scientific article; zbMATH DE number 1225794

zbMATH Open0902.05037MaRDI QIDQ4220195FDOQ4220195

Authors: D. L. Belotserkovskij 

Publication date: 22 November 1998

Title of this publication is not available (Why is that?)

Recommendations

• Characterization of some extremal graphs with diameter no greater than three
• scientific article; zbMATH DE number 3882468
• The maximum number of edges in a minimal graph of diameter 2
• Graphs of diameter 3 with the minimum number of edges

zbMATH Keywords

vertexextremal graphedge

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cited In (9)

• On split graphs with four distinct eigenvalues
• On a valence problem in extremal graph theory
• An efficient algorithm for testing goal-minimality of graphs
• An extremal problem on degree sequences of graphs
• Note on extremal graphs with given matching number
• On Operator and Formal Sum Methods for Graph Enumeration Problems
• An extremal problem for random graphs and the number of graphs with large even-girth
• Graphs of diameter 3 with the minimum number of edges
• Majorants and minorants for the classes of graphs with fixed diameter and number of vertices

This page was built for publication:

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