Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
From MaRDI portal
Publication:4667802
DOI10.1002/jgt.20053zbMath1062.05084OpenAlexW4236494124MaRDI QIDQ4667802
Lutz Volkmann, Angelika Hellwig
Publication date: 21 April 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20053
Related Items (39)
Fault-tolerant analysis of a class of networks ⋮ Restricted arc-connectivity of digraphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Optimization problems of the third edge-connectivity of graphs ⋮ Edge fault-tolerance of strongly Menger edge connected graphs ⋮ On reliability of the folded hypercubes ⋮ Vulnerability of super edge-connected networks ⋮ A characterization of graphs by codes from their incidence matrices ⋮ \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs ⋮ Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes ⋮ Codes from incidence matrices of graphs ⋮ On restricted edge-connectivity of replacement product graphs ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Minimally restricted edge connected graphs ⋮ ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS ⋮ 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 ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ Sufficient conditions for maximally edge-connected hypergraphs ⋮ On super edge-connectivity of product graphs ⋮ 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 ⋮ Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2 ⋮ Unnamed Item ⋮ Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\) ⋮ Edge-connectivity in hypergraphs ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 ⋮ Super connectivity of line graphs ⋮ Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected ⋮ Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs ⋮ The \(k\)-restricted edge connectivity of undirected Kautz graphs
Cites Work
This page was built for publication: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
