On size, order, diameter and minimum degree

DOI10.1007/s13226-013-0024-9zbMath1277.05054OpenAlexW2047141437MaRDI QIDQ384864

Simon Mukwembi

Publication date: 29 November 2013

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-013-0024-9

zbMATH Keywords

diametersizeminimum degree

Mathematics Subject Classification ID

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

Related Items (4)

Distances in graphs of girth 6 and generalised cages ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ On size, order, diameter and edge-connectivity of graphs ⋮ Size of graphs and digraphs with given diameter and connectivity constraints

Cites Work

• Unnamed Item
• Unnamed Item
• On the sizes of graphs and their powers: the undirected case
• On the least size of a graph with a given degree set
• Minimum size of a graph or digraph of given radius
• Maximum sizes of graphs with given domination parameters
• The average distance and the independence number
• Diameters in graphs

This page was built for publication: On size, order, diameter and minimum degree