Results 101 to 110 of about 828 (207)
A fast practical algorithm for the vertex separation of unicyclic graphs
, 2008 The vertex separation of a graph is the minimum vertex separation of a linear layout of that graph over all its linear layouts. A linear layout of a graph is an arrangement of its vertices in a line and the vertex separation of a linear layout is maximum
Markov, Minko Marinov.
core
, 2020 In the study of topological indices two negative correlations are well known: that between the number of subtrees and the Wiener index (sum of distances), and that between the Merrifield-Simmons index (number of independent vertex subsets) and the Hosoya index (number of independent edge subsets).
Andriantiana, Eric Ould Dadah, Wang, Hua
openaire +2 more sources
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
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
Indonesian Journal of CombinatoricsA planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3.
Christian Barrientos, Sarah Minion
doaj +1 more source
On the global offensive alliance in unicycle graphs
AKCE International Journal of Graphs and Combinatorics, 2018 11 pages, 1 ...
Mohamed Bouzefrane, Saliha Ouatiki
openaire +4 more sources
Eigenspaces for \(-2\) in signed line graphs
The American Journal of CombinatoricsIt is known that \(-2\) appears in the spectrum of a connected signed line graph if and only if its root is either (a) a balanced signed graph, not a tree, that spans a switching of the complete signed graph or (b) an unbalanced simply signed graph ...
Zoran Stanić
doaj +1 more source
Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination
IEEE Access, 2019 Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M1 and the second Zagreb index M2 have already studied. In particular, it has been presented, the first Zagreb index M1 and the second Zagreb index M2 of trees T in ...
Doost Ali Mojdeh +3 more
doaj +1 more source
Stable and semi-stable unicyclic graphs
, 1974 We show by a constructive proof, that if a unicyclic graph has a transposition in its automorphism group, then it is stable.
McAvaney, K.L. +5 more
core +1 more source
Independence and matching numbers of unicyclic graphs from null space [PDF]
, 2020 We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees ...
Molina, Gonzalo +4 more
core