Maximal distance spectral radius of 4-chromatic planar graphs

preprint2021arXivOpen access

We show that the kite graph $K_4^{(n)}$ uniquely maximizes the distance spectral radius among all connected $4$ -chromatic planar graphs on $n$ vertices.

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.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Maximal distance spectral radius of 4-chromatic planar graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0