On distance signless Laplacian spectrum of graphs and spectrum of zero divisor graphs of ℤn

Author(s):  
S. Pirzada ◽  
Bilal A. Rather ◽  
M. Aijaz ◽  
T. A. Chishti
2018 ◽  
Vol 42 (5) ◽  
pp. 2603-2621 ◽  
Author(s):  
A. Alhevaz ◽  
M. Baghipur ◽  
E. Hashemi ◽  
H. S. Ramane

2018 ◽  
Vol 10 (06) ◽  
pp. 1850074 ◽  
Author(s):  
Somnath Paul

Let [Formula: see text] and [Formula: see text] be three graphs on disjoint sets of vertices and [Formula: see text] has [Formula: see text] edges. Let [Formula: see text] be the graph obtained from [Formula: see text] and [Formula: see text] in the following way: (1) Delete all the edges of [Formula: see text] and consider [Formula: see text] disjoint copies of [Formula: see text]. (2) Join each vertex of the [Formula: see text]th copy of [Formula: see text] to the end vertices of the [Formula: see text]th edge of [Formula: see text]. Let [Formula: see text] be the graph obtained from [Formula: see text] by joining each vertex of [Formula: see text] with each vertex of [Formula: see text] In this paper, we determine the adjacency (respectively, Laplacian, signless Laplacian) spectrum of [Formula: see text] in terms of those of [Formula: see text] and [Formula: see text] As an application, we construct infinite pairs of cospectral graphs.


2010 ◽  
Vol 4 (1) ◽  
pp. 167-174 ◽  
Author(s):  
Slobodan Simic ◽  
Zoran Stanic

A graph is called Q-integral if its signless Laplacian spectrum consists entirely of integers. We establish some general results regarding signless Laplacians of semiregular bipartite graphs. Especially, we consider those semiregular bipartite graphs with integral signless Laplacian spectrum. In some particular cases we determine the possible Q-spectra and consider the corresponding graphs.


2014 ◽  
Vol 06 (04) ◽  
pp. 1450050
Author(s):  
Lizhen Xu ◽  
Changxiang He

Let G be an r-regular graph with order n, and G ∨ H be the graph obtained by joining each vertex of G to each vertex of H. In this paper, we prove that G ∨ K2is determined by its signless Laplacian spectrum for r = 1, n - 2. For r = n - 3, we show that G ∨ K2is determined by its signless Laplacian spectrum if and only if the complement of G has no triangles.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
S. R. Jog ◽  
Raju Kotambari

Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under spectral graph theory. In this paper, we compute adjacency, Laplacian, and signless Laplacian energy (Qenergy) of coalescence of pair of complete graphs. Also, as an application, we obtain the adjacency energy of subdivision graph and line graph of coalescence from itsQenergy.


Sign in / Sign up

Export Citation Format

Share Document