Skip to search formSkip to main contentSkip to account menu

Extremal graph theory

Known as: Extremal graph 
Extremal graph theory is a branch of the mathematical field of graph theory. Extremal graph theory studies extremal (maximal or minimal) graphs which… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Apollonian networkClique (graph theory)Cycle (graph theory)Erdős–Stone theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On the difference of two generalized connectivities of a graph
The concept of k-connectivity $$\kappa '_{k}(G)$$κk′(G) of a graph G, introduced by Chartrand in 1984, is a generalization of the… 
2017
2017
Extremal Values and Rankings of the Gutman Index of the Extended Double Stars
In 2016, Ivan Gutman et al. proposed the conception of the Gutman index of graphs. In this paper, based on the Gutman index of… 
2016
2016
Two Classes of Topological Indices of Phenylene Molecule Graphs
A phenylene is a conjugated hydrocarbons molecule composed of sixand four-membered rings. The matching energy of a graph G is… 
2013
2013
AN APPLICATION OF GROUP THEORY TO EXTREMAL GRAPH THEORY
Erdős has shown6 that the number of edges of any graph on v vertices and without 2k-cycles is O(v 1 k ). This bound is known to… 
2013
2013
Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this… 
2008
2008
Colorings and transversals of graphs
The subject of this thesis is a relaxation of proper graph colorings bounded monochromatic component colorings (bmc colorings). A… 
2004
2004
Extremal Graph Theory and Degree Sequences
The paper summarises briefly some recent results in extremal graph theory and degree sequences, and presents some open questions… 
2004
2004
On some interconnections between combinatorial optimization and extremal graph theory
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a… 
1997
1997
On the structure of extremal graphs of high girth
Let n ≥ 3 be a positive integer, and let G be a simple graph of order v containing no cycles of length smaller than n + 1 and… 
1991
1991
Some corollaries of a theorem of Whitney on the chromatic polynomial
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)