English

On the sign patterns of the smallest signless Laplacian eigenvector

Combinatorics 2013-07-31 v1

Abstract

Let HH be a connected bipartite graph, whose signless Laplacian matrix is Q(H)Q(H). Suppose that the bipartition of HH is (S,T)(S,T) and that xx is the eigenvector of the smallest eigenvalue of Q(H)Q(H). It is well-known that xx is positive and constant on SS, and negative and constant on TT. The resilience of the sign pattern of xx under addition of edges into the subgraph induced by either SS or TT is investigated and a number of cases in which the sign pattern of xx persists are described.

Keywords

Cite

@article{arxiv.1307.7749,
  title  = {On the sign patterns of the smallest signless Laplacian eigenvector},
  author = {Felix Goldberg and Steve Kirkland},
  journal= {arXiv preprint arXiv:1307.7749},
  year   = {2013}
}