Results 1 to 10 of about 605,731 (305)
On some interconnections between combinatorial optimization and extremal graph theory [PDF]
Yugoslav Journal of Operations Research, 2004 The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set.
Cvetković Dragoš M. +2 more
doaj +3 more sources
Extremal graph of super line graph operation via generalized Randić index
Ain Shams Engineering JournalGraph operations enable the modification and transformation of graphs, enhancing data representation as well as effectiveness in fields such as computer science, mathematics, and data analysis.
Muhammad Azeem +2 more
exaly +3 more sources
Tight upper bound on the maximum anti-forcing numbers of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number.
Lingjuan Shi, Heping Zhang
doaj +1 more source
Capture-Time Extremal Cop-Win Graphs
Discussiones Mathematicae Graph Theory, 2021 We investigate extremal graphs related to the game of Cops and Robbers. We focus on graphs where a single cop can catch the robber; such graphs are called cop-win.
Offner David, Ojakian Kerry
doaj +1 more source
On the Boundary of Incidence Energy and Its Extremum Structure of Tricycle Graphs
Frontiers in Physics, 2020 With the wide application of graph theory in circuit layout, signal flow chart and power system, more and more attention has been paid to the network topology analysis method of graph theory.
Hongyan Lu, Zhongxun Zhu
doaj +1 more source
The Signless Laplacian Estrada Index of Unicyclic Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 For a simple graph G, the signless Laplacian Estrada index is defined as SLEE(G)=∑ni=1eqi, where q1, q2,..., qn are the eigenvalues of the signless Laplacian matrix of G.
Hamid Reza Ellahi +3 more
doaj +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
AKCE International Journal of Graphs and Combinatorics, 2018 The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Construction Algorithm of Given Girth Graphs Based on Quantum Evolution [PDF]
Jisuanji gongcheng, 2017 To construct an extremal graph with a given girth is still a challenging problem of graph theory.Especially when the vertex number increasex combination explosion will appear.Thus,this paper proposes an algorithm for constructing graphs with given girth ...
FENG Xiaohua,SUN Yongqi
doaj +1 more source
Graph Entropy Based on Strong Coloring of Uniform Hypergraphs
Axioms, 2021 The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems ...
Lusheng Fang +3 more
doaj +1 more source
Solution to the minimum harmonic index of graphs with given minimum degree [PDF]
Transactions on Combinatorics, 2018 The harmonic index of a graph $G$ is defined as $ H(G)=\sum\limits_{uv\in E(G)}\frac{2}{d(u)+d(v)}$, where $d(u)$ denotes the degree of a vertex $u$ in $G$. Let $\mathcal{G}(n,k)$ be the set of simple $n$-vertex graphs with minimum degree at least $k$
Meili Liang, Bo Cheng, Jianxi Liu
doaj +1 more source