Results 21 to 30 of about 4,115 (305)
On the number of pentagons in triangle-free graphs [PDF]
, 2013 Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)(5) cycles of length five. Moreover, the equality is attained only when n is divisible by five and G is the balanced blow-up of the ...
Hatami, Hamed +4 more
core +1 more source
Extreme Monophonic Graphs and Extreme Geodesic Graphs
Tamkang Journal of Mathematics, 2016 For a connected graph $G=(V,E)$ of order at least two, a chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A monophonic set of $G$ is a set $S$ of vertices such that every vertex of $G$ lies on a monophonic path joining some pair of vertices in $S$.
P. Titus, A.P Santhakumaran
openaire +2 more sources
On the Roman Edge Domination Number of a Graph [PDF]
, 2010 Let G be a simple graph with vertex set V (G) and edge set E(G)
K. Ebadi +5 more
core +1 more source
Extremal properties of distance-based graph invariants for $k$-trees [PDF]
Mathematica Bohemica, 2018 Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index.
Minjie Zhang, Shuchao Li
doaj +1 more source
Note on the temperature Sombor index
Vojnotehnički Glasnik, 2023 Introduction/purpose: The temperature of a vertex of a graph of the order n is defined as d/(n-d), where d is the vertex degree. The temperature variant of the Sombor index is investigated and several of its properties established. Methods: Combinatorial
Ivan Gutman
doaj +1 more source
Extremal optimization for graph partitioning [PDF]
Physical Review E, 2001 34 pages, RevTex4, 1 table and 20 ps-figures included, related papers available at http://www.physics.emory.edu/faculty/boettcher/
Stefan Boettcher, Allon G. Percus
openaire +3 more sources
On the spread of outerplanar graphs
Special Matrices, 2022 The spread of a graph is the difference between the largest and most negative eigenvalue of its adjacency matrix. We show that for sufficiently large nn, the nn-vertex outerplanar graph with maximum spread is a vertex joined to a linear forest with Ω(n ...
Gotshall Daniel +2 more
doaj +1 more source
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core +1 more source
The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]
, 2011 Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai +3 more
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