Maximum principal ratio of the signless Laplacian of graphs

preprint2022arXivOpen access

Abstract

Let GG be a connected graph and Q(G)Q(G) be the signless Laplacian of GG. The principal ratio γ(G)γ(G) of Q(G)Q(G) is the ratio of the maximum and minimum entries of the Perron vector of Q(G)Q(G). In this paper, we consider the maximum principal ratio γ(G)γ(G) among all connected graphs of order nn, and show that for sufficiently large nn the extremal graph is a kite graph obtained by identifying an end vertex of a path to any vertex of a complete graph.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.