scientific article; zbMATH DE number 2188620

zbMath1074.05030MaRDI QIDQ5461702

Peter Dankelmann, Gcina Dlamini, Henda C. Swart

Publication date: 26 July 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

diameterradiusaverage distance\(K_{3,3}\)-free graph

Mathematics Subject Classification ID

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

Related Items (12)

An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph ⋮ Wiener index in graphs with given minimum degree and maximum degree ⋮ An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ Distances in graphs of girth 6 and generalised cages ⋮ Minimum degree, edge-connectivity and radius ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity ⋮ The radius of \(k\)-connected planar graphs with bounded faces ⋮ The number of edges in a bipartite graph of given radius ⋮ Minimum size of a graph or digraph of given radius ⋮ Diameter of 4-colourable graphs

This page was built for publication: