Maximal distance spectral radius of 4-chromatic planar graphs

DOI10.1016/J.LAA.2021.02.005zbMATH Open1462.05219OpenAlexW3127131941MaRDI QIDQ2020654FDOQ2020654

Authors Aysel Erey 

Publication date 24 April 2021

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2102.03566

zbMATH Keywords

chromatic numberplanar graphsdistance spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10)

Abstract: 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.

Cites work

• scientific article; zbMATH DE number 3482373 (Why is no real title available?)
• Clique number and distance spectral radii of graphs.
• Connectivity and minimal distance spectral radius of graphs
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Distance spectra of graphs: a survey
• Distance spectral radius of complete multipartite graphs and majorization
• Distance spectral radius of trees with fixed maximum degree
• Distance spectral radius of trees with given number of segments
• Every Planar Map is Four Colorable
• Grötzsch's theorem on 3-colorings
• On spectral radius of the distance matrix
• On the distance spectral radius of cacti
• On the distance spectral radius of trees
• On the maximal distance spectral radius of graphs without a pendent vertex
• Planar 4-critical graphs with four triangles
• Some graft transformations and its applications on the distance spectral radius of a graph
• Spectral radii of graphs with given chromatic number
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• The four-colour theorem
• The hyper-Wiener index of graphs with a given chromatic (clique) number

Cited in

(4)

• On the zero forcing number and spectral radius of graphs
• Graphs for which the second largest distance eigenvalue is less than \(- \frac{1}{2}\)
• Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
• Minimal non-selfcentric radially-maximal graphs of radius 4

This page was built for publication: Maximal distance spectral radius of 4-chromatic planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020654)