An Extremal Problem of Graphs with Diameter 2

DOI10.2307/2690069zbMATH Open0353.05045OpenAlexW4254907178MaRDI QIDQ4123359FDOQ4123359

Authors: Béla Bollobás, P. Erdős 

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2690069

Recommendations

• scientific article; zbMATH DE number 3882468
• scientific article; zbMATH DE number 3924817
• The maximum number of edges in a minimal graph of diameter 2
• Two path extremal graphs and an application to a Ramsey-type problem
• scientific article; zbMATH DE number 4008431

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (11)

• A family of graphs and the degree/diameter problem
• Hermitian matrices and graphs: Singular values and discrepancy
• Regular separable graphs of minimum order with given diameter
• Graphs with small diameter after edge deletion
• Size in maximal triangle-free graphs and minimal graphs of diameter 2
• Beyond Helly graphs: the diameter problem on absolute retracts
• Title not available (Why is that?)
• Diameter critical graphs
• Title not available (Why is that?)
• Property \(P_{d,m}\) and efficient design of reliable networks
• Title not available (Why is that?)

This page was built for publication: An Extremal Problem of Graphs with Diameter 2

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