Results 51 to 60 of about 7,057,923 (115)
A note on the distance and distance signless Laplacian spectral radius of complements of trees [PDF]
, 2023 In this article, we show that the generalized tree shift operation increases the distance spectral radius, distance signless Laplacian spectral radius, and the $D_\alpha$-spectral radius of complements of trees.
Mahato, Iswar, Kannan, M. Rajesh
core +1 more source
This research investigates the relationship between algebra and graph theory, specifically how algebra facilitates graph theory. Associating matrices with graphs introduces the concept of graph energies.
Abdurahim, Abdurahim +5 more
core +1 more source
The smallest eigenvalue of the signless Laplacian [PDF]
, 2011 Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied.
Nikiforov, Vladimir +7 more
core +1 more source
New bounds on the distance Laplacian and distance signless Laplacian spectral radii
, 2019 Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are derived.
Rojo, Óscar +2 more
core +1 more source
SymmetryThis paper extends the spectral analysis of distance-based matrices associated with chemical graph structures of order n, focusing on the distance matrix D(G), the distance Laplacian DL(G), and the distance signless Laplacian DQ(G).
Muneeba Mansha, Sarfraz Ahmad, A. Lupaș
semanticscholar +1 more source
Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core
On the distance signless Laplacian spectral radius, fractional matching and factors of graphs [PDF]
Reserche operationelleThe distance signless Laplacian matrix of a graph $G$ is defined as $Q(G)=$Tr$(G)+D(G)$, where Tr$(G)$ and $D(G)$ are the diagonal matrix of vertex transmissions and the distance matrix of $G$, respectively.
Zhen-Hao Zhang, Li-Gong Wang
semanticscholar +1 more source
The Signless Laplacian Matrix of Hypergraphs [PDF]
, 2019 In this paper we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix with structural parameters of the hypergraph ...
Trevisan, Vilmar, Cardoso, Kauê
core +1 more source
On Energy of Prime Ideal Graph of a Commutative Ring Associated with Transmission-Based Matrices
Malaysian journal of mathematical sciencesThis research explores the energy of the prime ideal graph of a commutative ring. The study demonstrates the energy formula of the graph associated with transmission-based matrices.
M. U. Romdhini +4 more
semanticscholar +1 more source
On the distance & distance (signless) Laplacian spectra of non-commuting graphs
, 2022 Let $Z(G)$ be the centre of a finite non-abelian group $G.$ The non-commuting graph of $G$ is a simple undirected graph with vertex set $G\setminus Z(G),$ and two vertices $u$ and $v$ are adjacent if and only if $uv\ne vu.$ In this paper, we investigate ...
Paul, Somnath, Kalita, Jharna
core