Radius, diameter, and minimum degree
From MaRDI portal
Publication:1262322
DOI10.1016/0095-8956(89)90066-XzbMath0686.05029OpenAlexW2082945930WikidataQ57253825 ScholiaQ57253825MaRDI QIDQ1262322
Richard Pollack, Zsolt Tuza, János Pach
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90066-x
Related Items (64)
An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph ⋮ Some properties on the tensor product of graphs obtained by monogenic semigroups ⋮ Wiener index in graphs with given minimum degree and maximum degree ⋮ An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph ⋮ An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ Some properties on the lexicographic product of graphs obtained by monogenic semigroups ⋮ Some remarks on rainbow connectivity ⋮ On the connectivity of diamond-free graphs ⋮ Improved bound on the oriented diameter of graphs with given minimum degree ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees ⋮ Formally verified algorithms for upper-bounding state space diameters ⋮ Distances in graphs of girth 6 and generalised cages ⋮ On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs ⋮ A new bound of radius with irregularity index ⋮ Average distance, minimum degree, and spanning trees ⋮ Minimum degree, edge-connectivity and radius ⋮ The Steiner diameter of a graph with prescribed girth ⋮ A characterization of graphs by codes from their incidence matrices ⋮ The average eccentricity of a graph with prescribed girth ⋮ On a classical theorem on the diameter and minimum degree of a graph ⋮ Bounds on the Steiner radius of a graph ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ Radius, girth and minimum degree ⋮ Maximum diameter of 3‐ and 4‐colorable graphs ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ Rainbow connections of graphs: a survey ⋮ Path eccentricity of graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Degree Distance in Graphs with Forbidden Subgraphs ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness ⋮ Large girth and small oriented diameter graphs ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ Upper bounds on the Steiner diameter of a graph ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity ⋮ The maximum radius of graphs with given order and minimum degree ⋮ A note on diameter and the degree sequence of a graph ⋮ Minimum orders of Eulerian oriented digraphs with given diameter ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ A cut locus for finite graphs and the farthest point mapping ⋮ Spanning trees with small diameters ⋮ Diameter, minimum degree and hyperbolicity constant in graphs ⋮ On size, order, diameter and edge-connectivity of graphs ⋮ Decompositions into Subgraphs of Small Diameter ⋮ The radius of \(k\)-connected planar graphs with bounded faces ⋮ The number of edges in a bipartite graph of given radius ⋮ Domination, radius, and minimum degree ⋮ Radius, Diameter and the Degree Sequence of a Graph ⋮ The diameter of directed graphs ⋮ Average eccentricity, minimum degree and maximum degree in graphs ⋮ Nordhaus-Gaddum relations for proximity and remoteness in graphs ⋮ On average distance in tournaments and Eulerian digraphs ⋮ Minimum size of a graph or digraph of given radius ⋮ Line graphs of monogenic semigroup graphs ⋮ Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree ⋮ Size of graphs and digraphs with given diameter and connectivity constraints ⋮ SOME PROPERTIES ON THE DISJUNCTIVE PRODUCT OVER GRAPHS OF MONOGENIC SEMIGROUPS ⋮ Degree Conditions for Embedding Trees ⋮ Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs ⋮ Diameter of orientations of graphs with given minimum degree
Cites Work
This page was built for publication: Radius, diameter, and minimum degree
