On the maximum spectral radius of planar graphs

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yu, Guanglong, Sun, Lin
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911245819445248
author Yu, Guanglong
Sun, Lin
author_facet Yu, Guanglong
Sun, Lin
contents This paper investigates the maximum spectral radius of planar graphs with concrete fixed number of vertices, providing some tight bounds on the maximum spectral radius of general planar graph resorting to its order, and confirming that among all planar graphs containing dominating vertex with concrete fixed order $n \geq 48$, the join of $P_{2}$ and $P_{n-2}$ attains the maximum spectral radius.
format Preprint
id arxiv_https___arxiv_org_abs_2510_24481
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On the maximum spectral radius of planar graphs
Yu, Guanglong
Sun, Lin
Combinatorics
This paper investigates the maximum spectral radius of planar graphs with concrete fixed number of vertices, providing some tight bounds on the maximum spectral radius of general planar graph resorting to its order, and confirming that among all planar graphs containing dominating vertex with concrete fixed order $n \geq 48$, the join of $P_{2}$ and $P_{n-2}$ attains the maximum spectral radius.
title On the maximum spectral radius of planar graphs
topic Combinatorics
url https://arxiv.org/abs/2510.24481