Sufficient conditions for λ′‐optimality in graphs with girth g
From MaRDI portal
Publication:5471060
DOI10.1002/jgt.20150zbMath1089.05024OpenAlexW4240624241MaRDI QIDQ5471060
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
Publication date: 6 June 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20150
Related Items (43)
A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Restricted arc-connectivity of digraphs ⋮ On edge cut of graphs leaving components of order at least five ⋮ On the restricted connectivity and superconnectivity in graphs with given girth ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ On optimizing edge connectivity of product graphs ⋮ \(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs ⋮ Codes from incidence matrices of graphs ⋮ Sufficient conditions for maximally restricted edge connected graphs ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ A sufficient condition for graphs to be \(\lambda_k\)-optimal ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ 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 ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Connectivity measures in matched sum graphs ⋮ Minimally restricted edge connected 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 ⋮ \(\lambda ^{\prime}\)-optimal digraphs ⋮ Sufficient conditions for a graph to be λ k -optimal with given girth and diameter ⋮ Neighborhood conditions for graphs to be super restricted edge connected ⋮ The restricted arc connectivity of Cartesian product digraphs ⋮ On super edge-connectivity of product graphs ⋮ 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 ⋮ Unnamed Item ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ Superconnectivity of regular graphs with small diameter ⋮ Minimally 3-restricted edge connected graphs ⋮ A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected ⋮ Edge-superconnectivity of semiregular cages with odd girth ⋮ 3-restricted connectivity of graphs with given girth ⋮ 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 ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs
This page was built for publication: Sufficient conditions for λ′‐optimality in graphs with girth g