Results 31 to 40 of about 80 (69)

Inequalities for Distance Signless Laplacian Matrix Under Minimum‐Degree Constraints

open access: yesJournal 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

Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs

open access: yesLe Matematiche, 2019
Summary: In this paper, we study the eigenvalues of the reciprocal distance signless Laplacian matrix of a connected graph and obtain some bounds for the maximum eigenvalue of this matrix. We also focus on bipartite graphs and find some bounds for the spectral radius of the reciprocal distance signless Laplacian matrix of this class of graphs. Moreover,
A. Alhevaz, M. Baghipur, H.S. Ramane
openaire   +1 more source

Investigating Signless Laplacian Spectra and Network Topology in Helical Phenylene‐Quadrilateral Structures

open access: yesJournal 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

Distance Spectra of Some Double Join Operations of Graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.
In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha   +4 more
wiley   +1 more source

On the eigenvalues of the distance signless Laplacian matrix of graphs

open access: yesProyecciones (Antofagasta)
Let G be a connected graph and let DQ(G) be the distance signless Laplacian matrix of G with eigenvalues ρ1≥ ρ2≥…≥ ρn. The spread of the matrix DQ}(G) is defined as s(DQ(G)) := maxi,j| ρi-ρj| = ρ1- ρn. We derive new bounds for the distance signless Laplacian spectral radius ρ1 of G.
Akbar Jahanbani   +3 more
openaire   +1 more source

Eigenvalue-based entropy in directed complex networks. [PDF]

open access: yesPLoS One, 2021
Sun Y, Zhao H, Liang J, Ma X.
europepmc   +1 more source

Home - About - Disclaimer - Privacy