Diameters in graphs
From MaRDI portal
Cited in
(45)- On reciprocal complementary Wiener number
- Unique eccentric point graphs
- Graphs of maximum diameter
- Changing and unchanging the diameter of a hypercube
- Peripheral and eccentric vertices in graphs
- Further criteria for the indecomposability of finite pseudometric spaces
- On minimal embedding of two graphs as center and periphery
- Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs
- Computations in isometry groups of finite metric spaces
- Size of graphs and digraphs with given diameter and connectivity constraints
- Complexity and algorithms for constant diameter augmentation problems
- An asymptotic resolution of a problem of Plesník
- The largest graphs with given order and diameter: a simple proof
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- Diameter-critical graphs
- Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
- Distances in graphs of girth 6 and generalised cages
- A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter
- A conjecture on average distance and diameter of a graph
- scientific article; zbMATH DE number 2185577 (Why is no real title available?)
- Conditional diameter saturated graphs
- On size, order, diameter and minimum degree
- Upper bound of the number of edges of a homogeneous connected hypergraph with a given diameter
- Anticritical graphs
- Vertex-critical graphs of given diameter
- Distance and size in digraphs
- Exponent-critical primitive graphs and the Kronecker product
- Steiner 4-diameter, maximum degree and size of a graph
- Maximum size of digraphs of given radius
- Diametral path graphs
- On the sizes of graphs and their powers: the undirected case
- Primitive diameter 2-critical graphs
- A note on diameter and the degree sequence of a graph
- Bounds for eccentricity-based parameters of graphs
- On size, order, diameter and edge-connectivity of graphs
- On the geometric-arithmetic index by decompositions -- CMMSE
- A diameter bound for 4-edge-connected C₄-free graphs
- Characterize all \(C_5\)-free diameter-2-critical graphs with at least \(\lfloor \frac{ ( n - 1 )^2}{ 4} \rfloor + 1\) edges
- Remoteness of graphs with given size and connectivity constraints
- Combinatorial identification problems and graph powers
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- On the upper bounds of the numbers of perfect matchings in graphs with given parameters
- Maximizing the spectral radius of k-connected graphs with given diameter
- Diameter critical graphs
- Diameter and maximum degree in Eulerian digraphs
This page was built for publication: Diameters in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563931)
