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 connectedSufficient conditions for \(k\)-restricted edge connected graphsRestricted arc-connectivity of digraphsOn edge cut of graphs leaving components of order at least fiveOn the restricted connectivity and superconnectivity in graphs with given girthOn the super‐restricted arc‐connectivity of s ‐geodetic digraphsOn the restricted arc-connectivity of \(s\)-geodetic digraphsOn maximal 3-restricted edge connectivity and reliability analysis of hypercube networksOn optimizing edge connectivity of product graphs\(\lambda ^{\prime}\)-optimally connected mixed Cayley graphsCodes from incidence matrices of graphsSufficient conditions for maximally restricted edge connected graphs\(\lambda^{\prime}\)-optimality of bipartite digraphsA sufficient condition for graphs to be \(\lambda_k\)-optimalSufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connectedMaximally edge-connected and vertex-connected graphs and digraphs: A surveyDiameter-girth sufficient conditions for optimal extraconnectivity in graphs\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphsOn the edge-connectivity and restricted edge-connectivity of a product of graphsConnectivity measures in matched sum graphsMinimally restricted edge connected graphsOn 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 digraphsSufficient conditions for a graph to be λ k -optimal with given girth and diameterNeighborhood conditions for graphs to be super restricted edge connectedThe restricted arc connectivity of Cartesian product digraphsOn super edge-connectivity of product graphsDiameter-sufficient conditions for a graph to be super-restricted connectedOn the connectivity and restricted edge-connectivity of 3-arc graphsOn 3-restricted edge connectivity of undirected binary Kautz graphsSufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2Unnamed ItemCalculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)Superconnectivity of regular graphs with small diameterMinimally 3-restricted edge connected graphsA neighborhood condition for graphs to be maximally \(k\)-restricted edge connectedEdge-superconnectivity of semiregular cages with odd girth3-restricted connectivity of graphs with given girthSufficient 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 graphsOnm-restricted edge connectivity of undirected generalized De Bruijn graphs






This page was built for publication: Sufficient conditions for λ′‐optimality in graphs with girth g