Super connectivity of line graphs
From MaRDI portal
Publication:1041748
DOI10.1016/j.ipl.2005.02.001zbMath1184.68366MaRDI QIDQ1041748
Meijie Ma, Min Lu, Jun-Ming Xu, Angelika Hellwig
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.02.001
combinatorial problems; line graphs; super connectivity; super-\(\lambda ^{\prime}\); super edge-connectivity; \(\lambda^{\prime}\)-connected
Related Items
On extra connectivity and extra edge-connectivity of balanced hypercubes, The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes, Super connectivity of Kronecker product of complete bipartite graphs and complete graphs, \(\{2,3\}\)-extraconnectivities of hypercube-like networks, Double-super-connected digraphs, On super restricted edge-connectivity of edge-transitive graphs, Super \(p\)-restricted edge connectivity of line graphs, On reliability of the folded hypercubes, The super connectivity of exchanged crossed cube, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, The super connectivity of augmented cubes, On super edge-connectivity of product graphs, Diameter-sufficient conditions for a graph to be super-restricted connected, Super-connected but not super edge-connected graphs, The super connectivity of exchanged hypercubes, Fault-tolerant analysis of a class of networks, Super connectivity of balanced hypercubes, On super connectivity of Cartesian product graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Note on the connectivity of line graphs
- Synthesis of reliable networks - a survey
- Theory and Application of Graphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted edge-connectivity of graphs.