On the spectral radius and energy of signless Laplacian matrix of digraphs [PDF]
Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D.
Hilal A. Ganie, Yilun Shang
doaj +2 more sources
Color signless Laplacian energy of graphs
In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families
Pradeep G. Bhat, Sabitha D’Souza
doaj +2 more sources
On the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings [PDF]
The graph with the largest signless Laplacian spectral radius among all bicyclic graphs with perfect matchings is determined.
Jing-Ming Zhang +2 more
doaj +2 more sources
A note on the signless Laplacian eigenvalues of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
WANG JF, BELARDO, FRANCESCO
openaire +4 more sources
On the signless Laplacian and normalized signless Laplacian spreads of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milovanovic, Emina +3 more
openaire +3 more sources
On the Laplacian and Signless Laplacian Characteristic Polynomials of a Digraph
Let D be a digraph with n vertices and a arcs. The Laplacian and the signless Laplacian matrices of D are, respectively, defined as L(D)=Deg+(D)−A(D) and Q(D)=Deg+(D)+A(D), where A(D) represents the adjacency matrix and Deg+(D) represents the diagonal matrix whose diagonal elements are the out-degrees of the vertices in D.
Hilal A. Ganie, Yilun Shang
openaire +1 more source
Color laplacian and color signless laplacian energy of complement of subgroup graph of dihedral group [PDF]
Laplacian and signless laplacian energy of a finite graph is the most interesting topics on areas of energy of a graph. The new concept of energy of a graph is color energy and furthermore color laplacian and color signless laplacian energy.
Mohammad Jauhari +7 more
core +1 more source
On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number
A supertree is a connected and acyclic hypergraph. Denote by Tm,n,α the set of m‐uniform supertrees of order n with independent number α. Focusing on the spectral radius in Tm,n,α, this present completely determines the hypergraphs with maximum spectral radius among all the supertrees with n vertices and independence number α for [m − 1/mn] ≤ α ≤ n − 1,
Lei Zhang +2 more
wiley +1 more source
The Signless Laplacian Estrada Index of Unicyclic Graphs [PDF]
For a simple graph G, the signless Laplacian Estrada index is defined as SLEE(G)=∑ni=1eqi, where q1, q2,..., qn are the eigenvalues of the signless Laplacian matrix of G.
Hamid Reza Ellahi +3 more
doaj +1 more source
Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks
Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks. Meanwhile, the weight is a vital factor in characterizing some properties of real networks.
Haiqin Liu, Yanling Shao, Azhar Hussain
wiley +1 more source

