An Extremal Problem of Graphs with Diameter 2

DOI10.2307/2690069MaRDI QIDQ4123359zbMATH OpenOpenAlexFDO

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

Publication date 1975

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

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

Cited in

(11)

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

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)