Results 31 to 40 of about 114 (91)
Bounds on the Spectral Radius of a Nonnegative Matrix and Its Applications
Journal of Applied Mathematics, Volume 2016, Issue 1, 2016., 2016 We obtain the sharp bounds for the spectral radius of a nonnegative matrix and then obtain some known results or new results by applying these bounds to a graph or a digraph and revise and improve two known results.
Danping Huang, Lihua You, Ali R. Ashrafi
wiley +1 more source
Ain Shams Engineering JournalIn this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj +1 more source
The Least Algebraic Connectivity of Graphs
Discrete Dynamics in Nature and Society, Volume 2015, Issue 1, 2015., 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. In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees, but not stars, and among all ...
Guisheng Jiang +3 more
wiley +1 more source
Linear Algebra and its Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tian, Fenglei, Wong, Dein, Rou, Jianling
openaire +1 more source
The Largest Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter
Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013 We identify graphs with the maximal Laplacian spectral radius among all unicyclic graphs with n vertices and diameter d.
Haixia Zhang, Baolin Wang
wiley +1 more source
Bounds for the Generalized Distance Eigenvalues of a Graph [PDF]
, 2019 Let G be a simple undirected graph containing n vertices. Assume G is connected. Let D(G) be the distance matrix, DL(G) be the distance Laplacian, DQ(G) be the distance signless Laplacian, and Tr(G) be the diagonal matrix of the vertex transmissions ...
Abdollah Alhevaz +7 more
core +1 more source
Characterization of extremal graphs from distance signless Laplacian eigenvalues
Linear Algebra and its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu, Das, Kinkar Ch.
openaire +2 more sources
On the sum of powers of Laplacian eigenvalues of bipartite graphs [PDF]
, 2010 summary:For a bipartite graph $G$ and a non-zero real $\alpha $, we give bounds for the sum of the $\alpha $th powers of the Laplacian eigenvalues of $G$ using the sum of the squares of degrees, from which lower and upper bounds for the incidence ...
Ilić, Aleksandar, Zhou, Bo
core +1 more source
Inequalities for Distance Signless Laplacian Matrix Under Minimum‐Degree Constraints
Journal of Mathematics, Volume 2026, Issue 1, 2026.For a connected graph G of order n, let D(G) denote its distance matrix and let Tr(G) be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ = D(G) + Tr(G). The largest eigenvalue of DQ, written as ∂1QG, is referred to as the distance signless Laplacian spectral radius of G.
Mohd Abrar Ul Haq +3 more
wiley +1 more source
Journal of Mathematics, Volume 2025, Issue 1, 2025.This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif +3 more
wiley +1 more source