Radius, diameter, and minimum degree

Authors:
P. Erdős;Janos Pach;R. Pollack;Zsolt Tuza
Affiliations:
Hungarian Academy of Sciences, Budapest;Hungarian Academy of Sciences, Budapest;Hungarian Academy of Sciences, Budapest;Courant Institute of Mathematical Sciences, NY
Venue:
Journal of Combinatorial Theory Series B - Series B
Year:
1989

Citing 0
Cited 12

The diameter of directed graphs

Journal of Combinatorial Theory Series B
On the connectivity of diamond-free graphs

Discrete Applied Mathematics
Diameter of 4-colourable graphs

European Journal of Combinatorics
Note: Domination, radius, and minimum degree

Discrete Applied Mathematics
Minimum size of a graph or digraph of given radius

Information Processing Letters
Nordhaus-Gaddum relations for proximity and remoteness in graphs

Computers & Mathematics with Applications
Decompositions into subgraphs of small diameter

Combinatorics, Probability and Computing
Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts

Discrete Applied Mathematics
Note: Upper bounds on the Steiner diameter of a graph

Discrete Applied Mathematics
Rainbow connection number and connected dominating sets

Journal of Graph Theory
Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts

Theoretical Computer Science
Minimum degree, edge-connectivity and radius

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract