Results 1 to 10 of about 1,618,968 (159)

Color signless Laplacian energy of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2017
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

The Extremal Structures of r-Uniform Unicyclic Hypergraphs on the Signless Laplacian Estrada Index

open access: yesMathematics, 2022
SLEE has various applications in a large variety of problems. The signless Laplacian Estrada index of a hypergraph H is defined as SLEE(H)=∑i=1neλi(Q), where λ1(Q),λ2(Q),…,λn(Q) are the eigenvalues of the signless Laplacian matrix of H. In this paper, we
Hongyan Lu, Zhongxun Zhu
doaj   +2 more sources

On maximum signless Laplacian Estrada index of graphs with given parameters II [PDF]

open access: yesElectronic Journal of Graph Theory and Applications, 2018
The signless Laplacian Estrada index of a graph G is defined as SLEE(G) = ∑ni = 1eqi where q1, q2, …, qn are the eigenvalues of the signless Laplacian matrix of G.
Ramin Nasiri   +3 more
doaj   +2 more sources

Universal adjacency spectrum of zero divisor graph on the ring and its complement

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A and
Saraswati Bajaj, Pratima Panigrahi
doaj   +1 more source

Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph

open access: yesMathematics, 2023
Using the notions of clique partitions and edge clique covers of graphs, we consider the corresponding incidence structures. This connection furnishes lower bounds on the negative eigenvalues and their multiplicities associated with the adjacency matrix,
Shaun Fallat, Seyed Ahmad Mojallal
doaj   +1 more source

A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs

open access: yesJournal of Inequalities and Applications, 2020
In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj   +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

On the Aα-Spectral Radii of Cactus Graphs

open access: yesMathematics, 2020
Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang   +3 more
doaj   +1 more source

Applications on color (distance) signless laplacian energy of annihilator monic prime graph of commutative rings

open access: yesAin Shams Engineering Journal
In 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

Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy

open access: yesMathematics
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy