Abstract
Let be a graph with vertices. We denote the largest signless Laplacian eigenvalue of by and Laplacian eigenvalues of by . It is a conjecture on Laplacian spread of graphs that or equivalently $μ_1(G)+μ_1(\Gb)\le2n-1$. We prove the conjecture for bipartite graphs. Also we show that for any bipartite graph , $μ_1(G)μ_1(\Gb)\le n(n-1)$. Aouchiche and Hansen [A survey of Nordhaus--Gaddum type relations, Discrete Appl. Math. 161 (2013), 466--546] conjectured that %for any graph with vertices, $q_1(G)+q_1(\Gb)\le3n-4$ and $q_1(G)q_1(\Gb)\le2n(n-2)$. We prove the former and disprove the latter by constructing a family of graphs where $q_1(H_n)q_1(\ov{H_n})$ is about .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.