Ordering cacti with signless Laplacian spread
2018 ◽
Vol 34
◽
pp. 609-619
◽
Keyword(s):
A cactus is a connected graph in which any two cycles have at most one vertex in common. The signless Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the smallest eigenvalue of the associated signless Laplacian matrix. In this paper, all cacti of order n with signless Laplacian spread greater than or equal to n â 1/2 are determined.
Keyword(s):
2008 ◽
Vol Vol. 10 no. 1
(Graph and Algorithms)
◽
2019 ◽
Vol 13
(06)
◽
pp. 2050113
◽
2016 ◽
Vol 31
◽
pp. 60-68
◽
2020 ◽
Vol 36
(36)
◽
pp. 214-227
◽