On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
From MaRDI portal
Publication:409406
DOI10.1016/J.DISC.2011.08.021zbMATH Open1238.05135OpenAlexW2030756145MaRDI QIDQ409406FDOQ409406
Authors: Weihua Yang, Zhao Zhang, Chengfu Qin, Xiaofeng Guo 
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.021
Recommendations
- On super restricted edge-connectivity of vertex-transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- On super restricted edge connectivity of half vertex transitive graphs
- scientific article; zbMATH DE number 2108131
- Super restricted edge-connectivity of graphs with diameter 2
- On super connectedness and super restricted edge-connectedness of total graphs.
- Super 3-restricted edge connectivity of triangle-free graphs.
Cites Work
- Graph theory
- Title not available (Why is that?)
- Extraconnectivity of graphs with large girth
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Title not available (Why is that?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Über ein Problem von K. Zarankiewicz
- Super restricted edge-connectivity of vertex-transitive graphs
- Optimally super-edge-connected transitive graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Title not available (Why is that?)
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Title not available (Why is that?)
- Connectivity of transitive graphs
- Graphs without quadrilaterals
- Title not available (Why is that?)
- On optimally-\(\lambda^{(3)}\) transitive graphs
- Super edge connectivity properties of connected edge symmetric graphs
Cited In (19)
- On the conditional edge connectivity of double-orbit graphs
- Vulnerability of super edge-connected networks
- A characterization of graphs by codes from their incidence matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On super restricted edge-connectivity of edge-transitive graphs
- Super \(s\)-restricted edge-connectivity of vertex-transitive graphs
- Under which conditions is λ″(G)=κ″(L(G)) ?
- 4-factor-criticality of vertex-transitive graphs
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- On restricted edge-connectivity of vertex-transitive multigraphs
- Super restricted edge-connectivity of vertex-transitive graphs
- On a kind of restricted edge connectivity of graphs
- On optimally-\(\lambda^{(3)}\) transitive graphs
- A Note on the Connectivity of m-Ary n-Dimensional Hypercubes
- Optimally super-edge-connected transitive graphs
- Super 3-restricted edge connectivity of triangle-free graphs.
- Supereulerian 3-path-quasi-transitive digraphs
- A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
This page was built for publication: On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409406)
