Super restricted edge-connectivity of vertex-transitive graphs
From MaRDI portal
Publication:1763355
DOI10.1016/j.disc.2004.08.011zbMath1056.05092MaRDI QIDQ1763355
Publication date: 22 February 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.011
Related Items
\(\{2,3\}\)-extraconnectivities of hypercube-like networks, A characterization of graphs by codes from their incidence matrices, On super 2-restricted and 3-restricted edge-connected vertex transitive graphs, Super restricted edge connectivity of regular edge-transitive graphs, On super restricted edge-connectivity of edge-transitive graphs, Optimization problems of the third edge-connectivity of graphs, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Diameter-girth sufficient conditions for optimal extraconnectivity in graphs, Edge-connectivity of regular graphs with two orbits, Edge fault tolerance analysis of super \(k\)-restricted connected networks, Super restricted edge connected Cartesian product graphs, Some remarks on \(\lambda _{p,q}\)-connectedness, Super edge-connectivity of mixed Cayley graph, Diameter-sufficient conditions for a graph to be super-restricted connected, On the existence of edge cuts leaving several large components, On the 3-restricted edge connectivity of permutation graphs, Super connectivity of line graphs, On super restricted edge connectivity of half vertex transitive graphs, Super-connected but not super edge-connected graphs, On the edge-connectivity of graphs with two orbits of the same size
Cites Work
