Abstract
Let be a connected graph and be the signless Laplacian of . The principal ratio of is the ratio of the maximum and minimum entries of the Perron vector of . In this paper, we consider the maximum principal ratio among all connected graphs of order , and show that for sufficiently large the extremal graph is a kite graph obtained by identifying an end vertex of a path to any vertex of a complete graph.
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.