Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
From MaRDI portal
Publication:1827779
DOI10.1016/j.disc.2004.01.008zbMath1042.05056OpenAlexW2077293169MaRDI QIDQ1827779
Angelika Hellwig, Lutz Volkmann
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.01.008
Related Items (29)
Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Fault-tolerant analysis of a class of networks ⋮ Restricted arc-connectivity of digraphs ⋮ Optimization problems of the third edge-connectivity of graphs ⋮ On the restricted connectivity and superconnectivity in graphs with given girth ⋮ On reliability of the folded hypercubes ⋮ On optimizing edge connectivity of product graphs ⋮ \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs ⋮ Codes from incidence matrices of graphs ⋮ On restricted edge-connectivity of replacement product graphs ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs ⋮ Matching cutsets in graphs of diameter 2 ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs ⋮ \(\lambda ^{\prime}\)-optimal digraphs ⋮ The restricted arc connectivity of Cartesian product digraphs ⋮ Sufficient conditions for triangle-free graphs to be super-$λ'$ ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs ⋮ On 3-restricted edge connectivity of undirected binary Kautz graphs ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ Super connectivity of line graphs ⋮ Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- On the superconnectivity of generalized \(p\)-cycles
- On super-edge-connected digraphs and bipartite digraphs
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted edge-connectivity of graphs.
This page was built for publication: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
