Results 21 to 30 of about 1,304 (147)

On comparison between the distance energies of a connected graph [PDF]

Heliyon
Let G be a simple connected graph of order n having Wiener index W(G). The distance, distance Laplacian and the distance signless Laplacian energies of G are respectively defined asDE(G)=∑i=1n|υiD|,DLE(G)=∑i=1n|υiL−Tr‾|andDSLE(G)=∑i=1n|υiQ−Tr‾|, where ...
Hilal A. Ganie, Bilal Ahmad Rather, Yilun Shang   +2 more
doaj   +2 more sources

A note on two conjectures relating the independence number and spectral radius of the signless Laplacian matrix of a graph

Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, 2018
Let G be a simple graph. In this paper, we disprove two conjectures proposed by P. Hansen and C. Lucas in the paper Bounds and conjectures for the signless Laplacian index of graphs. We find an infinite class of graphs as a counterexample for two conjectures relating the spectral radius of the signless Laplacian and the independence number of G.
Jorge Alencar, Leonardo Lima
openaire   +3 more sources

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

Journal of Mathematics
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.
Fareeha Hanif, Ali Raza, Md. Shajib Ali
doaj   +2 more sources

Comparison of Different Properties of Graph Using Adjacency Matrix and Signless Laplacian Matix

International Journal of Scientific Research in Science, Engineering and Technology
This study highlights the advantages of using the Signless Laplacian spectrum over the traditional Adjacency matrix spectrum for graph representation. It demonstrates that the Signless Laplacian possesses greater representational power and stronger characterization properties, making it a more effective tool for analyzing graph structures. Particularly,
null Km. Priti Sahrawat, null Dr. Ashish Kumar   +1 more
openaire   +3 more sources

Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph

Applied Mathematics and Computation, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maden, A. Dilek (Gungor), Das, Kinkar Ch., Cevik, A. Sinan   +2 more
openaire   +5 more sources

ON THE SPECTRAL CHARACTERISTICS OF SIGNLESS LAPLACIAN MATRIX [PDF]

South East Asian Journal of Mathematics and Mathematical Sciences
Pallabi Bora, Muktarul Rahman
openaire   +2 more sources

On the path cospectral graphs and path signless Laplacian matrix of graphs

Journal of Mathematical and Computational Science, 2020
openaire   +2 more sources

NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS [PDF]

Journal of Algebraic Systems, 2021
The distance signless Laplacian spectral radius of a connected graph $G$ is the largest eigenvalue of the distance signless Laplacian matrix of $G$, defined as $D^{Q}(G)=Tr(G)+D(G)$, where $D(G)$ is the distance matrix of $G$ and $Tr(G)$ is the diagonal ...
A. Alhevaz, M. Baghipur, S. Paul
doaj   +1 more source

Chromatic number and signless Laplacian spectral radius of graphs [PDF]

Transactions on Combinatorics, 2022
For any simple graph $G$, the signless Laplacian matrix of $G$ is defined as $D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of vertex degrees and the adjacency matrix of $G$, respectively.
Mohammad Reza Oboudi
doaj   +1 more source

Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]

Transactions on Combinatorics, 2021
‎Given a simple graph $G$‎, ‎the distance signlesss Laplacian‎ ‎$D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix‎ ‎$Tr(G)$ and distance matrix $D(G)$‎.
Abdollah Alhevaz, ‎Maryam Baghipur, Shariefuddin Pirzada, Yilun Shang   +3 more
doaj   +1 more source