A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter

DOI10.1007/S00373-023-02628-WOpenAlexW4360979828WikidataQ123130375 ScholiaQ123130375MaRDI QIDQ2698536FDOQ2698536

Authors: Leilei Zhang 

Publication date: 24 April 2023

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

Full work available at URL: https://arxiv.org/abs/2203.06978

zbMATH Keywords

sizediameterextremal graphs\(k\)-connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Diameters in graphs
• The largest graphs with given order and diameter: a simple proof

Cited In (2)

• The maximum principal ratio of graphs
• A simple proof of Ore's theorem on the maximum size of k-connected graphs with given order and diameter

This page was built for publication: A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698536)