Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,737,665 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Apollonian network
Clique (graph theory)
Cycle (graph theory)
Erdős–Stone theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Two Classes of Topological Indices of Phenylene Molecule Graphs
TingzengWu
2016
Corpus ID: 73630601
A phenylene is a conjugated hydrocarbons molecule composed of sixand four-membered rings. The matching energy of a graph G is…
Expand
2016
2016
On the signless Laplacian spectral radius of $C_{4}$-free $k$-cyclic graphs
Q. Kong
,
Ligong Wang
2016
Corpus ID: 119136026
A $k$-cyclic graph is a connected graph of order $n$ and size $n+k-1$. In this paper, we determine the maximal signless Laplacian…
Expand
Review
2015
Review
2015
Extremal Graph Theory for Degree Sequences
Xiaodong Zhang
2015
Corpus ID: 119664034
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected…
Expand
2015
2015
Cacti with maximum Kirchhoff index
Wen-Rui Wang
,
Xiangfeng Pan
2015
Corpus ID: 119315371
The concept of resistance distance was first proposed by Klein and Randi\'c. The Kirchhoff index $Kf(G)$ of a graph $G$ is the…
Expand
2013
2013
AN APPLICATION OF GROUP THEORY TO EXTREMAL GRAPH THEORY
A. Woldar
,
V. Ustimenko
2013
Corpus ID: 115314927
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…
Expand
2013
2013
Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index
Kexiang Xu
2013
Corpus ID: 6538439
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this…
Expand
Review
2010
Review
2010
Modeling and Simulation of Mobile Ad hoc Networks
K. Erciyes
,
Orhan Dağdeviren
,
Deniz Cokuslu
,
Onur Yilmaz
,
H. Gumus
2010
Corpus ID: 15777138
A model is a simplified representation of a system that aids the understanding and investigation of the real system. Simulation…
Expand
2010
2010
ON SOME VARIATIONS OF EXTREMAL GRAPH PROBLEMS
Discussiones Mathematicae
2010
Corpus ID: 18315357
A set P of graphs is termed hereditary property if and only if it contains all subgraphs of any graph G belonging to P. A graph…
Expand
Review
2008
Review
2008
Homomorphisms of Graphs
J. Lyle
2008
Corpus ID: 55098839
Abstract : The works of Hartmanis and Stearns, Krohn and Rhodes, Yoeli and Ginzburg, and Zeiger amply demonstrate the usefulness…
Expand
1998
1998
Bulk-Synchronous Parallel Multiplication of Boolean Matrices
A. Tiskin
International Colloquium on Automata, Languages…
1998
Corpus ID: 30893714
We correct an error in the analysis of local computation cost of a bulk-synchronous parallel algorithm for Boolean matrix…
Expand