Maximal distance spectral radius of 4-chromatic planar graphs

DOI10.1016/j.laa.2021.02.005zbMath1462.05219arXiv2102.03566OpenAlexW3127131941MaRDI QIDQ2020654

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

planar graphschromatic numberdistance spectral radius

Mathematics Subject Classification ID

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

Related Items (1)

On the zero forcing number and spectral radius of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal distance spectral radius of graphs without a pendent vertex
• Some graft transformations and its applications on the distance spectral radius of a graph
• On the distance spectral radius of cacti
• Planar 4-critical graphs with four triangles
• Spectral radii of graphs with given chromatic number
• The four-colour theorem
• Distance spectral radius of trees with given number of segments
• Distance spectra of graphs: a survey
• Distance spectral radius of complete multipartite graphs and majorization
• Connectivity, diameter, independence number and the distance spectral radius of graphs
• Grötzsch's theorem on 3-colorings
• On the distance spectral radius of trees
• Connectivity and minimal distance spectral radius of graphs
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Distance spectral radius of trees with fixed maximum degree
• Every Planar Map is Four Colorable
• On spectral radius of the distance matrix

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