Pages that link to "Item:Q2287761"
From MaRDI portal
The following pages link to The largest graphs with given order and diameter: a simple proof (Q2287761):
Displaying 5 items.
- On size, order, diameter and minimum degree (Q384864) (← links)
- The largest parity demigenus of a simple graph (Q1362103) (← links)
- A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter (Q2698536) (← links)
- A conjecture on average distance and diameter of a graph (Q2890990) (← links)
- Bounds for eccentricity-based parameters of graphs (Q6657268) (← links)