Results 61 to 70 of about 1,644,718 (204)

First Hyper Zagreb Spectral Radii of Splitting and Shadow Graphs

open access: yesScientific Annals of Computer Science
The spectral radius RS of graph G is a spectral invariant derived from the eigenvalues of the associated matrix for a graph G. It is widely used in fields such as computer science, chemistry, biology, and network analysis.
Ahmad Bilal, Muhammad Mobeen Munir
doaj   +1 more source

The First Zagreb Index, the Laplacian Spectral Radius, and Some Hamiltonian Properties of Graphs

open access: yesMathematics
The first Zagreb index of a graph G is defined as the sum of the squares of the degrees of all the vertices in G. The Laplacian spectral radius of a graph G is defined as the largest eigenvalue of the Laplacian matrix of the graph G.
Rao Li
doaj   +1 more source

The spectral radius of graphs with no intersecting odd cycles [PDF]

open access: yesDiscrete Mathematics, 2021
Yongtao Li, Yuejian Peng
semanticscholar   +1 more source

On the maximum spectral radius of multipartite graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be an integer. A graph is called r – partite if V admits a partition into r parts such that every edge has its ends in different parts. All of the r – partite graphs with given integer r consist of the class of multipartite graphs.
Jian Wu, Haixia Zhao
doaj   +1 more source

Comparison Theorems for Single and Double Splittings of Matrices

open access: yesJournal of Applied Mathematics, 2013
Some comparison theorems for the spectral radius of double splittings of different matrices under suitable conditions are presented, which are superior to the corresponding results in the recent paper by Miao and Zheng (2009).
Cui-Xia Li, Qun-Fa Cui, Shi-Liang Wu
doaj   +1 more source

Extremal Unicyclic Graphs With Minimal Distance Spectral Radius

open access: yesDiscussiones Mathematicae Graph Theory, 2014
The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj   +1 more source

Home - About - Disclaimer - Privacy