scientific article; zbMATH DE number 1225794

MaRDI QIDQ4220195zbMATH OpenFDO

Authors D. L. Belotserkovskij

Publication date 22 November 1998

zbMATH Keywords

vertexextremal graphedge

Mathematics Subject Classification ID

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

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

Cited in

(9)

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

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)