On the public citation graph

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions

https://doi.org/10.1002/net.20440

0 signed · 62 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0037(199708)30:1<73::aid-net8>3.0.co;2-iopenalex-snapshot

Introduction to graph theory

inferredcites →https://doi.org/10.1002/jgt.3190080406openalex-snapshot

Circulants and their connectivities

inferredcites →https://doi.org/10.1002/net.10096openalex-snapshot

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)‐star graphs

inferredcites →https://doi.org/10.1002/net.20187openalex-snapshot

Matching preclusion for some interconnection networks

inferredcites →https://doi.org/10.1007/978-1-4419-8698-6openalex-snapshot

Theory and Application of Graphs

inferredcites →https://doi.org/10.1007/bf01788139openalex-snapshot

Vosperian and superconnected Abelian Cayley digraphs

inferredcites →https://doi.org/10.1007/s00373-007-0725-0openalex-snapshot

Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs

inferredcites →https://doi.org/10.1016/j.dam.2009.10.002openalex-snapshot

On the connectivity and superconnected graphs with small diameter

inferredcites →https://doi.org/10.1016/j.ins.2003.09.023openalex-snapshot

Hyper hamiltonian laceability on edge fault star graph

inferredcites →https://doi.org/10.1016/j.ins.2008.10.029openalex-snapshot

Conditional matching preclusion sets

inferredcites →https://doi.org/10.1016/j.tcs.2009.02.041openalex-snapshot

Conditional matching preclusion for hypercube-like interconnection networks

inferredcites →https://doi.org/10.1080/00207160902883514openalex-snapshot

Matching preclusion for the (n, k)-bubble-sort graphs

inferredcites →https://doi.org/10.1109/71.755822openalex-snapshot

Fault-free Hamiltonian cycles in faulty arrangement graphs

inferredcites →https://doi.org/10.1109/tc.2004.1255789openalex-snapshot

Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs

inferredcites →https://doi.org/10.1109/tr.1986.4335424openalex-snapshot

Synthesis of reliable networks - a survey

inferredcites →https://doi.org/10.1142/9789811273117_0001openalex-snapshot

Introduction to Graph Theory

inferredcites →https://doi.org/10.1142/s0129054108006364openalex-snapshot

MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS

inferredcites →https://doi.org/10.1201/b12336-12openalex-snapshot

Introduction to Graph Theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4658349openalex-extracted

inferred← citeshttps://doi.org/10.1002/jgt.22764openalex-snapshot

Perfect matchings in highly cyclically connected regular graphs

inferred← citeshttps://doi.org/10.1002/net.20441openalex-snapshot

Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars

inferred← citeshttps://doi.org/10.1002/net.21624openalex-snapshot

Robust recoverable perfect matchings

inferred← citeshttps://doi.org/10.1007/s10878-020-00530-2openalex-snapshot

Fractional matching preclusion number of graphs and the perfect matching polytope

inferred← citeshttps://doi.org/10.1007/s10878-022-00888-5openalex-snapshot

The fractional matching preclusion number of complete n-balanced k-partite graphs

inferred← citeshttps://doi.org/10.1007/s10878-023-01034-5openalex-snapshot

On anti-Kekulé and s-restricted matching preclusion problems

inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.040openalex-snapshot

Matching preclusion and conditional matching preclusion for regular interconnection networks

inferred← citeshttps://doi.org/10.1016/j.dam.2013.01.010openalex-snapshot

The (conditional) matching preclusion for burnt pancake graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.001openalex-snapshot

Matching preclusion for cube-connected cycles

inferred← citeshttps://doi.org/10.1016/j.dam.2016.02.001openalex-snapshot

Matching preclusion for vertex-transitive networks

inferred← citeshttps://doi.org/10.1016/j.dam.2018.02.012openalex-snapshot

Matching preclusion for n -grid graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.016openalex-snapshot

Matching preclusion for direct product of regular graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2021.04.011openalex-snapshot

Conditional matching preclusion for regular bipartite graphs and their Cartesian product

inferred← citeshttps://doi.org/10.1016/j.dam.2022.01.014openalex-snapshot

Fractional matching preclusion number of graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.021openalex-snapshot

Fractional matching preclusion numbers of Cartesian product graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.042openalex-snapshot

Higher order matching preclusion for regular interconnection networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.020openalex-snapshot

Matching preclusion for balanced hypercubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.009openalex-snapshot

Linearly many faults in dual-cube-like networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.002openalex-snapshot

Strong matching preclusion for augmented cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.046openalex-snapshot

Matching preclusion and conditional matching preclusion problems for the folded Petersen cube

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.051openalex-snapshot

Strong matching preclusion of (n,k)-star graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.12.035openalex-snapshot

Strong matching preclusion number of graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.050openalex-snapshot

Matching preclusion number in product graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.005openalex-snapshot

Matching preclusion number of graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.022openalex-snapshot

A note on generalized matching preclusion in bipartite graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.021openalex-snapshot

Fractional matching preclusion of product networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.004openalex-snapshot

The fractional (strong) matching preclusion number of complete k-partite graph

inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.003openalex-snapshot

Reliability analysis of the generalized balanced hypercube

inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114449openalex-snapshot

Integer k-matching preclusion of some interconnection networks

inferred← citeshttps://doi.org/10.1080/17445760.2014.1000323openalex-snapshot

Strong matching preclusion of burnt pancake graphs

inferred← citeshttps://doi.org/10.1080/23799927.2016.1249412openalex-snapshot

Maximally matched and super matched regular graphs

inferred← citeshttps://doi.org/10.1080/23799927.2018.1552991openalex-snapshot

Strong matching preclusion problem of the folded Petersen cube

inferred← citeshttps://doi.org/10.1142/s0129054124500114openalex-snapshot

Conditional Fractional Matching Preclusion Number of Graphs

inferred← citeshttps://doi.org/10.1142/s0129626420400095openalex-snapshot

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks

inferred← citeshttps://doi.org/10.1142/s0219265910002726openalex-snapshot

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES

inferred← citeshttps://doi.org/10.1142/s0219265911003003openalex-snapshot

STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS

inferred← citeshttps://doi.org/10.1142/s0219265913500072openalex-snapshot

STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS

inferred← citeshttps://doi.org/10.1142/s0219265916500043openalex-snapshot

Strong Matching Preclusion of Arrangement Graphs

inferred← citeshttps://doi.org/10.1142/s0219265919400061openalex-snapshot

A Concise Survey of Matching Preclusion in Interconnection Networks

inferred← citeshttps://doi.org/10.1142/s0219265919400115openalex-snapshot

Conditional Matching Preclusion for Folded Hypercubes

inferred← citeshttps://doi.org/10.1142/s0219265923500202openalex-snapshot

Tight Toughness, Isolated Toughness and Binding Number Bounds for the Star-Path Factor

inferred← citeshttps://doi.org/10.20429/tag.2018.050101openalex-snapshot

Generalized Matching Preclusion in Bipartite Graphs

inferred← citeshttps://doi.org/10.20429/tag.2019.060105openalex-snapshot

Matching Preclusion of the Generalized Petersen Graph

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.