The existence and upper bound for two types of restricted connectivity
From MaRDI portal
Publication:968169
DOI10.1016/j.dam.2009.10.017zbMath1221.05223OpenAlexW2056380167WikidataQ59442843 ScholiaQ59442843MaRDI QIDQ968169
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.10.017
Related Items (3)
A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs ⋮ A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices ⋮ Spectral threshold for extremal cyclic edge-connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Super-connected edge transitive graphs
- Semi-hyper-connected vertex transitive graphs
- Super-connected arc-transitive digraphs
- Extraconnectivity of graphs with large girth
- Subsets with small sums in abelian groups. I: The Vosper property
- Cuts leaving components of given minimum order
- Connectivity of vertex and edge transitive graphs
- On the extraconnectivity of graphs
- Note on the connectivity of line graphs
- Semi-hyper-connected edge transitive graphs
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Synthesis of reliable networks - a survey
This page was built for publication: The existence and upper bound for two types of restricted connectivity
