On inertia and ratio type bounds for the kk-independence number of a graph and their relationship

preprint2022arXivOpen access

Abstract

For k≥1k\ge 1, the kk-independence number αkα_k of a graph is the maximum number of vertices that are mutually at distance greater than kk. The well-known inertia and ratio bounds for the (1-)independence number α(=α1)α(=α_1) of a graph, due to Cvetković and Hoffman, respectively, were generalized recently for every value of kk. We show that, for graphs with enough regularity, the polynomials involved in such generalizations are closely related and give exact values for αkα_k, showing a new relationship between the inertia and ratio type bounds. Additionally, we investigate the existence and properties of the extremal case of sets of vertices that are mutually at maximum distance for walk-regular graphs. Finally, we obtain new sharp inertia and ratio type bounds for partially walk-regular graphs by using the predistance polynomials.

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.