Results 81 to 90 of about 891,390 (207)
Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
Discrete Dynamics in Nature and Society, 2020 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices.
Gai-Xiang Cai, Xing-Xing Li, Gui-Dong Yu
doaj +1 more source
On the Maximum SC Index of Chemical Unicyclic Graphs
Journal of Mathematics, Volume 2025, Issue 1, 2025.The sum‐connectivity (SC) index of a graph G is defined as SCG=∑μν∈EG1/Θμ+Θν, where Θμ denotes the vertex degree of μ in G. In this paper, the fourth largest value of SC index for the chemical unicyclic graphs of order n ≥ 7 is determined.
Hui-Yan Cheng +3 more
wiley +1 more source
Unicyclic graphs with maximal energy
Linear Algebra and its Applications, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hou, Yaoping +2 more
openaire +2 more sources
Mathematika, Volume 70, Issue 4, October 2024.Abstract Given a graph on n$n$ vertices with m$m$ edges, each of unit resistance, how small can the average resistance between pairs of vertices be? There are two very plausible extremal constructions — graphs like a star, and graphs which are close to regular — with the transition between them occurring when the average degree is 3.
J. Robert Johnson, Mark Walters
wiley +1 more source
A note on the width of sparse random graphs
Journal of Graph Theory, Volume 106, Issue 2, Page 273-295, June 2024.Abstract In this note, we consider the width of a supercritical random graph according to some commonly studied width measures. We give short, direct proofs of results of Lee, Lee and Oum, and of Perarnau and Serra, on the rank‐ and tree‐width of the random graph G(n,p) $G(n,p)$ when p=1+ϵn $p=\frac{1+\epsilon }{n}$ for ϵ>0 $\epsilon \gt 0$ constant ...
Tuan Anh Do, Joshua Erde, Mihyun Kang
wiley +1 more source
An Approach to the Extremal Inverse Degree Index for Families of Graphs with Transformation Effect
Journal of Chemistry, 2021 The inverse degree index is a topological index first appeared as a conjuncture made by computer program Graffiti in 1988. In this work, we use transformations over graphs and characterize the inverse degree index for these transformed families of graphs.
Muhammad Asif +4 more
doaj +1 more source
The domination number and the least $Q$-eigenvalue [PDF]
, 2013 A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang +3 more
core
An upper bound on the largest signless Laplacian of an odd unicyclic graph
, 2012 We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.
M. Collao, Pamela Pizarro, O. Rojo
semanticscholar +1 more source
IET Control Theory &Applications, Volume 18, Issue 8, Page 977-986, May 2024.Abstract This paper is concerned with the synchronization of stochastic uncertain complex dynamic networks with time‐varying delays. In contrast to existing synchronization network models, the current study considers both internal time‐varying delays and coupling time‐varying delays. By analyzing the two factors (i.e.
Xuhui Guo +3 more
wiley +1 more source
AN ISOMORPHISM THEOREM FOR UNICYCLIC GRAPHS
Demonstratio Mathematica, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources