Superconnected digraphs and graphs with small conditional diameters

DOI10.1002/net.10020zbMath0999.05048MaRDI QIDQ4537622

Camino Balbuena, Ignacio M. Pelayo, J. Fàbrega, Xavier Marcote

Publication date: 1 July 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10020

zbMATH Keywords

digraph; superconnectivity; conditional diameter

Mathematics Subject Classification ID

05C12: Distance in graphs

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity

Related Items

Connectedness of digraphs and graphs under constraints on the conditional diameter, On the connectivity of cages with girth five, six and eight, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter, Diameter and connectivity of (D; g)-cages, Conditional diameter saturated graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• Super edge-connectivity of dense digraphs and graphs
• Bipartite graphs and digraphs with maximum connectivity
• On the linegraph of a directed-graph
• Line Digraph Iterations and the (d, k) Digraph Problem
• Circulants and their connectivities
• Conditional connectivity
• Synthesis of reliable networks - a survey
• Maximally connected digraphs