Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected

From MaRDI portal
Revision as of 17:38, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 networksRestricted arc-connectivity of digraphsSufficient conditions for optimally and super m-restricted edge-connected graphs with given girthOptimization problems of the third edge-connectivity of graphsEdge fault-tolerance of strongly Menger edge connected graphsOn reliability of the folded hypercubesVulnerability of super edge-connected networksA characterization of graphs by codes from their incidence matrices\(\lambda ^{\prime}\)-optimally connected mixed Cayley graphsReliability measures in relation to the h-extra edge-connectivity of folded hypercubesCodes from incidence matrices of graphsOn restricted edge-connectivity of replacement product graphsEdge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphsSufficient conditions for maximally restricted edge connected graphsEdge fault tolerance of super edge connectivity for three families of interconnection networks\(\lambda^{\prime}\)-optimality of bipartite digraphsThe \(k\)-restricted edge connectivity of balanced bipartite graphsMaximally edge-connected and vertex-connected graphs and digraphs: A surveyMinimally restricted edge connected graphsON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHSOn the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphsSufficient conditions for a graph to be λ k -optimal with given girth and diameterNeighborhood conditions for graphs to be super restricted edge connectedSufficient conditions for maximally edge-connected hypergraphsOn super edge-connectivity of product graphsSufficient conditions for triangle-free graphs to be super-$λ'$Diameter-sufficient conditions for a graph to be super-restricted connectedOn the connectivity and restricted edge-connectivity of 3-arc graphsSufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2Unnamed ItemDegree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)Edge-connectivity in hypergraphsEdge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal propertySufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2Super connectivity of line graphsSufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connectedEdges of degree \(k\) in minimally restricted \(k\)-edge connected graphsThe \(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