Graphs of diameter 3 with the minimum number of edges

DOI10.1007/BF01787701zbMath0718.05029OpenAlexW2025832515MaRDI QIDQ2639069

Zoltan Fueredi

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787701

zbMATH Keywords

diametermaximum degreeminimum number of edgesporcupines

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (2)

A characterization of line graphs that are squares of graphs ⋮ Steiner diameter, maximum degree and size of a graph

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs of diameter 3 with the minimum number of edges