On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs

DOI10.1016/0012-365X(94)90036-1zbMath0808.05047MaRDI QIDQ1336711

D. Frank Hsu, Tomasz Łuczak

Publication date: 8 December 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper bounddiameter\(k\)-regular \(k\)-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Related Items (19)

Dense bipartite circulants and their routing via rectangular twisted torus ⋮ On 2-power unicyclic cubic graphs ⋮ Steiner 4-diameter, maximum degree and size of a graph ⋮ Geometric bounds for convergence rates of averaging algorithms ⋮ Random lifts of graphs are highly connected ⋮ Wide diameter for two families of interconnection networks ⋮ The wide-diameter of \(Z_{n, k}\) ⋮ Randomly twisted hypercubes ⋮ Wide diameter of Cartesian graph bundles ⋮ Routing properties of supercubes ⋮ The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths ⋮ \((s,m)\)-radius of \(k\)-connected graphs ⋮ Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph ⋮ Short containers in Cayley graphs ⋮ Disjoint paths of bounded length in large generalized cycles ⋮ On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs ⋮ On the total\(_k\)-diameter of connection networks ⋮ Rabin numbers of Butterfly networks ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks

Cites Work

• Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs