Electron. J. Linear Algebra 22, 151-160, electronic only (2011)
Summary
Summary: The signless Laplacian separator of a graph is defined as the difference between the largest eigenvalue and the second largest eigenvalue of the associated signless Laplacian matrix.In this paper, we determine the maximum signless Laplacian separators of unicyclic, bicyclic and tricyclic graphs with given order.
