Results 71 to 80 of about 891,390 (207)
Laplacian Spectral Characterization of Some Unicyclic Graphs
Journal of Applied Mathematics, 2014 Let W(n;q,m1,m2) be the unicyclic graph with n vertices obtained by attaching two paths of lengths m1 and m2 at two adjacent vertices of cycle Cq. Let U(n;q,m1,m2,…,ms) be the unicyclic graph with n vertices obtained by attaching s paths of lengths m1,m2,
Lijun Yu, Hui Wang, Jiang Zhou
doaj +1 more source
Revolutionaries and spies on trees and unicyclic graphs
, 2011 A team of $r$ {\it revolutionaries} and a team of $s$ {\it spies} play a game on a graph $G$. Initially, revolutionaries and then spies take positions at vertices.
Cranston, Daniel W. +2 more
core +2 more sources
Stress in Directed Graphs: A Generalization of Graph Stress
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.In graph theory, centrality measures are used to identify the most important or influential nodes within a network. Stress centrality is one such measure, which helps quantify how “stressed” a node is within the overall graph structure based on the number of shortest paths that pass through it. Stress centrality provides a more thorough assessment of a
K. V. Madhumitha +4 more
wiley +1 more source
Sharp Lower Bounds of the Sum-Connectivity Index of Unicyclic Graphs
Journal of Mathematics, 2021 The sum-connectivity index of a graph G is defined as the sum of weights 1/du+dv over all edges uv of G, where du and dv are the degrees of the vertices u and v in graph G, respectively.
Maryam Atapour
doaj +1 more source
On extremal bipartite unicyclic graphs
Linear Algebra and its Applications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Qingying, Chen, Haiyan
openaire +1 more source
Unicyclic graphs with large energy
Linear Algebra and its Applications, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andriantiana E.O.D., Wagner S.
openaire +3 more sources
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 Minimal Total Irregularity of Graphs [PDF]
, 2014 In \cite{2012a}, Abdo and Dimitov defined the total irregularity of a graph $G=(V,E)$ as \hskip3.3cm $\rm irr_{t}$$(G) = \frac{1}{2}\sum_{u,v\in V}|d_{G}(u)-d_{G}(v)|, $ \noindent where $d_{G}(u)$ denotes the vertex degree of a vertex $u\in V$.
Yang, Jieshan, You, Lihua, Zhu, Yingxue
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
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