Results 81 to 90 of about 580,793 (206)
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
The Least Algebraic Connectivity of Graphs
Discrete Dynamics in Nature and Society, 2015 The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected.
Guisheng Jiang, Guidong Yu, Jinde Cao
doaj +1 more source
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
Electronic Journal of Graph Theory and Applications, 2019 We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necesary conditions are satisfied.
John Fahnenstiel, Dalibor Froncek
doaj +1 more source
Maximum Laplacian energy of unicyclic graphs
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das +3 more
openaire +3 more sources
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 core of a unicyclic graph
, 2011 A set S ⊆ V is independent in a graph G = (V,E) if no two vertices from S are adjacent. By core(G) we mean the intersection of all maximum independent sets.
Vadim E. Levit, Eugen Mandrescu
core
On the signless Laplacian coefficients of unicyclic graphs
, 2013 Let G be a graph of order n and let View the MathML source be the characteristic polynomial of the signless Laplacian of G. Let Eg,n (respectively, Cg(Sn−g+1)) denote the unicyclic graph of order n obtained by a coalescence of a vertex in the cycle Cg ...
譚必信 +2 more
core +1 more source
Complement of the generalized total graph of fields
AKCE International Journal of Graphs and Combinatorics, 2020 Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
doaj +1 more source
Some results on the Laplacian eigenvalues of unicyclic graphs [PDF]
, 2009 In this paper, we provide the smallest value of the second largest Laplacian eigenvalue for any unicyclic graph, and find the unicyclic graphs attaining that value.
Li, Jianxi +2 more
core +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