Diameters in graphs
From MaRDI portal
Publication:5563931
DOI10.1016/S0021-9800(68)80030-4zbMath0175.20804MaRDI QIDQ5563931
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (40)
An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH ⋮ Computations in isometry groups of finite metric spaces ⋮ Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter ⋮ Distances in graphs of girth 6 and generalised cages ⋮ On the upper bounds of the numbers of perfect matchings in graphs with given parameters ⋮ Unnamed Item ⋮ Steiner 4-diameter, maximum degree and size of a graph ⋮ On size, order, diameter and minimum degree ⋮ Maximum size of digraphs of given radius ⋮ Maximizing the spectral radius of \(k\)-connected graphs with given diameter ⋮ Diametral path graphs ⋮ An asymptotic resolution of a problem of Plesník ⋮ Diameter critical graphs ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter ⋮ On the sizes of graphs and their powers: the undirected case ⋮ Distance and size in digraphs ⋮ A note on diameter and the degree sequence of a graph ⋮ Anticritical graphs ⋮ Conditional diameter saturated graphs ⋮ Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs ⋮ Graphs of maximum diameter ⋮ On size, order, diameter and edge-connectivity of graphs ⋮ On the geometric-arithmetic index by decompositions -- CMMSE ⋮ Changing and unchanging the diameter of a hypercube ⋮ Vertex-critical graphs of given diameter ⋮ Peripheral and eccentric vertices in graphs ⋮ The largest graphs with given order and diameter: a simple proof ⋮ Size of graphs and digraphs with given diameter and connectivity constraints ⋮ Upper bound of the number of edges of a homogeneous connected hypergraph with a given diameter ⋮ On reciprocal complementary Wiener number ⋮ Diameter-critical graphs ⋮ Further criteria for the indecomposability of finite pseudometric spaces ⋮ Combinatorial identification problems and graph powers ⋮ Complexity and algorithms for constant diameter augmentation problems ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ Unique eccentric point graphs ⋮ Exponent-critical primitive graphs and the Kronecker product ⋮ On minimal embedding of two graphs as center and periphery
This page was built for publication: Diameters in graphs
