Diameter-girth sufficient conditions for optimal extraconnectivity in graphs

DOI10.1016/J.DISC.2007.07.012MaRDI QIDQ932676zbMATH OpenOpenAlexFDO

Authors C. Balbuena, A. Diánez, Xavier Marcote, Martín Cera, P. García-Vázquez

Publication date 11 July 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.07.012

zbMATH Keywords

diameterconnectivitygirthcutsetsuperconnectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• On the extraconnectivity of graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Extraconnectivity of graphs with large minimum degree and girth
• Extraconnectivity of graphs with large girth
• Extraconnectivity of \(s\)-geodetic digraphs and graphs

Cites work

• scientific article; zbMATH DE number 4162905 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• Circulants and their connectivities
• Conditional connectivity
• Edge cuts leaving components of order at least \(m\)
• Edge-cuts leaving components of order at least three
• Extraconnectivity of graphs with large girth
• Extraconnectivity of graphs with large minimum degree and girth
• On computing a conditional edge-connectivity of a graph
• On the extraconnectivity of graphs
• On the restricted connectivity and superconnectivity in graphs with given girth
• Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
• Sufficient conditions for '-optimality in graphs of diameter 2
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Super restricted edge-connectivity of vertex-transitive graphs
• Synthesis of reliable networks - a survey

Cited in

(16)

• Connectedness of digraphs and graphs under constraints on the conditional diameter
• Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
• Cyclic arc-connectivity in a Cartesian product digraph
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• The k-restricted edge connectivity of undirected Kautz graphs
• On the restricted arc-connectivity of \(s\)-geodetic digraphs
• On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
• The \(p\)-restricted edge-connectivity of Kneser graphs
• Sufficient conditions for a graph to be \(\lambda_k\)-optimal with given girth and diameter
• Sufficient conditions for graphs to be maximally 4-restricted edge connected
• The \(h\)-extra connectivity of \(k\)-ary \(n\)-cubes
• The existence and upper bound for two types of restricted connectivity
• On the 3-restricted edge connectivity of permutation graphs
• Extraconnectivity of graphs with large minimum degree and girth

This page was built for publication: Diameter-girth sufficient conditions for optimal extraconnectivity in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932676)