Results 81 to 90 of about 963 (204)
Independent Dominating Sets in Unicyclic Graphs
, 2022 Wilf found the maximum number of independent dominating sets of a tree using algebraic methods, while Sagan gave an elementary proof. In this thesis, we maximize the number of independent dominating sets of unicyclic graphs, giving a new proof of a ...
Lopez, Rachel
core
On General Sum‐Connectivity Index and Number of Segments of Fixed‐Order Chemical Trees
Journal of Mathematics, Volume 2025, Issue 1, 2025.Nowadays, one of the most active areas in mathematical chemistry is the study of the mathematical characteristics associated with molecular descriptors. The primary objective of the current study is to find the largest value of χα of graphs in the class of all fixed‐order chemical trees with a particular number of segments for α > 1, where χα is the ...
Muzamil Hanif +5 more
wiley +1 more source
On Minimum Generalized Degree Distance Index of Cyclic Graphs
International Journal of Mathematics and Mathematical Sciences, 2023 Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan +3 more
doaj +1 more source
Unicyclic graphs with large energy
, 2011 We study the energy (i.e., the sum of the absolute values of all eigenvalues) of so-called tadpole graphs, which are obtained by joining a vertex of a cycle to one of the ends of a path.
Stephan Wagner +5 more
core +1 more source
Journal of Mathematics, Volume 2025, Issue 1, 2025.The multiplicative sum Zagreb index of a graph G is defined as the product of the sum of the degrees of adjacent vertices of G. A molecular tree is an acyclic connected graph with maximum degree at most 4. A vertex in a molecular tree with degree 3 or 4 is referred to as a branching vertex. In this paper, we consider the class of all molecular trees of
Sadia Noureen +6 more
wiley +1 more source
On the eccentric connectivity index of unicyclic graphs
, 2018 Summary: In this paper, we obtain the upper and lower bounds on the eccentricity connectivity index of unicyclic graphs with perfect matchings. Also, we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
Nacaroglu, Yasar, Maden, Ayse Dilek
openaire +2 more sources
The Harary Index of All Unicyclic Graphs with Given Diameter
Discrete Dynamics in Nature and Society, 2018 The Harary index of G is the sum of reciprocals of distance between any two vertices in G. In this paper, we obtain the graphs with the maximum and second-maximum Harary indices among n-vertex unicyclic graphs with diameter d.
Bao-Hua Xing +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
Some Results on the Signless Laplacian Spectra of Unicyclic Graphs [PDF]
, 2011 We determine the second to fourth largest (resp. the second smallest) signless Laplacian spectral radii and the second to fourth largest signless Laplacian spreads together with the corresponding graphs in the class of unicyclic graphs with n vertices ...
Muhuo Liu
core +1 more source
Greedoids on Vertex Sets of Unicycle Graphs
CoRR, 2009 9 pages; 4 ...
Vadim E. Levit, Eugen Mandrescu
openaire +2 more sources