Results 31 to 40 of about 34,294 (314)
A Unified Approach for Extremal General Exponential Multiplicative Zagreb Indices
Axioms, 2023 The study of the maximum and minimal characteristics of graphs is the focus of the significant field of mathematics known as extreme graph theory. Finding the biggest or smallest graphs that meet specified criteria is the main goal of this discipline ...
Rashad Ismail +4 more
doaj +1 more source
Short proofs of some extremal results [PDF]
, 2013 We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have ...
Beck +11 more
core +5 more sources
Counting the number of dissociation sets in cubic graphs
AIMS Mathematics, 2023 Let $ G $ be a graph. A dissociation set of $ G $ is a subset of vertices that induces a subgraph with vertex degree at most 1. The dissociation polynomial of $ G $ is $ D_{G}(\lambda) = \sum_{D \in \mathcal{D}(G)} \lambda^{|D|} $, where $ \mathcal{D}(G)
Jianhua Tu , Junyi Xiao, Rongling Lang
doaj +1 more source
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
Complexity, 2021 Graph theory is a dynamic tool for designing and modeling of an interconnection system by a graph. The vertices of such graph are processor nodes and edges are the connections between these processors nodes. The topology of a system decides its best use.
Muhammad Asif +5 more
doaj +1 more source
Polytopes from Subgraph Statistics [PDF]
, 2011 Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them.
Engström, Alexander, Norén, Patrik
core +2 more sources
An advance in infinite graph models for the analysis of transportation networks
International Journal of Applied Mathematics and Computer Science, 2016 This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
, 2014 Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs.
Krivelevich, Michael
core +1 more source
Asymptotic Structure for the Clique Density Theorem
Discrete Analysis, 2020 Asymptotic structure for the clique density theorem, Discrete Analysis 2020:19, 26 pp. Turán's theorem, which is regarded as the "first" result in extremal graph theory, is the statement that the $K_r$-free graph on $n$ vertices with the largest number ...
Jaehoon Kim +3 more
doaj +1 more source
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices [PDF]
Yugoslav Journal of Operations Research, 2019 The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G.
Devillez Gauvain +3 more
doaj +1 more source