Matching preclusion for vertex-transitive networks
From MaRDI portal
Publication:290107
DOI10.1016/j.dam.2016.02.001zbMath1337.05094arXiv1502.01442OpenAlexW1626629448MaRDI QIDQ290107
Qiuli Li, Heping Zhang, Jinghua He
Publication date: 1 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.01442
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs, Conditional fractional matching preclusion of \(n\)-dimensional torus networks, A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs, Fractional Matching Preclusion for (n,k)-Star Graphs, Fractional matching preclusion numbers of Cartesian product graphs, Strong matching preclusion for \(k\)-composition networks, Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract), Matching preclusion number in product graphs, The fractional (strong) matching preclusion number of complete \(k\)-partite graph, Matching preclusion for \(n\)-grid graphs, A note on generalized matching preclusion in bipartite graphs, Conditional matching preclusion for regular bipartite graphs and their Cartesian product, Matching preclusion for direct product of regular graphs, Fractional matching preclusion number of graphs and the perfect matching polytope, Fractional matching preclusion for arrangement graphs, Matching preclusion for \(n\)-dimensional torus networks
Cites Work
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching theory
- Optimally super-edge-connected transitive graphs
- Matching preclusion for balanced hypercubes
- The (conditional) matching preclusion for burnt pancake graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
- Matching preclusion for the (n, k)-bubble-sort graphs
- On Representatives of Subsets
- Matching preclusion for some interconnection networks
- The Factorization of Linear Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item