Signless laplacian spectral characterization of roses [PDF]
A p-rose graph Γ = RG(a3, a4, . . . , as) is a graph consisting of p =a3 + a4 + · · · + as ≥ 2 cycles that all meet in one vertex, and ai (3 ≤ i ≤ s) is the number of cycles in Γ of length i.
ALI ZEYDI ABDIAN +2 more
doaj +2 more sources
On the Signless Laplacian ABC-Spectral Properties of a Graph
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +2 more sources
Signless Laplacian energy, distance Laplacian energy and distance signless Laplacian spectrum of unitary addition Cayley graphs [PDF]
In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
P., Naveen, A. V, Chithra
openaire +2 more sources
Spectrum of Signless 1-Laplacian on Simplicial Complexes [PDF]
We introduce the signless 1-Laplacian and the dual Cheeger constant on simplicial complexes. The connection of its spectrum to the combinatorial properties like independence number, chromatic number and dual Cheeger constant is investigated. Our estimates can be comparable to Hoffman's bounds on Laplacian eigenvalues of simplicial complexes.
Xin Luo, Dong Zhang
openaire +2 more sources
On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise.
Gholam Hossein Fath-Tabar
doaj +1 more source
New bounds for the spread of the signless Laplacian spectrum [PDF]
The spread of the singless Laplacian of a simple graph G is defined as SQ(G) = μ1(G)− μn(G) , where μ1(G) and μn(G) are the maximum and minimum eigenvalues of the signless Laplacian matrix of G , respectively. In this paper, we will present some new lower and upper bounds for SQ(G) in terms of clique and independence numbers.
Guengoer, A. Dilek Maden +2 more
openaire +2 more sources
THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA [PDF]
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph.
A. Zeydi Abdian +2 more
doaj +1 more source
$Kite_{p+2,p}$ is determined by its Laplacian spectrum [PDF]
$Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $p\geq4$ to an endpoint of path graph with order $n-p$. It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H.
Hatice Topcu
doaj +1 more source
(Generalized) Incidence and Laplacian‐Like Energies
In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε(≠0,1), we found generalized and improved bounds for the sum of ε‐th powers of Laplacian and signless Laplacian eigenvalues of Γ.
A. Dilek Maden +2 more
wiley +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

