On size, order, diameter and minimum degree
From MaRDI portal
Publication:384864
DOI10.1007/S13226-013-0024-9zbMATH Open1277.05054OpenAlexW2047141437MaRDI QIDQ384864FDOQ384864
Authors: 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
Recommendations
Cites Work
- Maximum sizes of graphs with given domination parameters
- Title not available (Why is that?)
- The average distance and the independence number
- Title not available (Why is that?)
- Diameters in graphs
- 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
Cited In (15)
- The largest graphs with given order and diameter: a simple proof
- On size, order, diameter and edge-connectivity of graphs
- Approximate minimum diameter
- Graphs of maximum diameter
- Radius, diameter and the degree sequence of a graph
- Title not available (Why is that?)
- On a classical theorem on the diameter and minimum degree of a graph
- Radius, diameter, and minimum degree
- Size of graphs and digraphs with given diameter and connectivity constraints
- On size, order, minimum degree and conditional diameter of graphs
- On size, radius and minimum degree
- Distances in graphs of girth 6 and generalised cages
- Radius, girth and minimum degree
- Radius, leaf number, connected domination number and minimum degree
- A note on diameter and the degree sequence of a graph
This page was built for publication: On size, order, diameter and minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384864)
