Relationship Between the Second Largest Adjacency and Signless Laplacian Eigenvalues of Graphs and Properties of Planar Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i4.5364Keywords:
Second largest eigenvalue, Planar graph, Crossing number, Graph Thickness, Graph SkewnessAbstract
A graph’s second largest eigenvalue is a significant algebraic characteristic that provides details on the graph’s expansion, connectivity, and randomness. Bounds for the second largest eigenvalue of a graph, denoted as λ2 were previously established in the literature in relation to graph parameters like edge connectivity and vertex connectivity, matching number, independence
number, and edge expansion constant, among others. A graph is planar if it can be drawn in a plane without graph edges crossing. Determining the planarity of a graph helps in optimizing, simplifying, and understanding complex systems across various fields. Graph skewness, graph thickness, and graph crossing number are a few metrics that describe how much a graph deviates from planarity. In this work, we ascertain the relationship between the graph’s properties, including graph skewness, thickness, and crossing number, and the graph’s second largest eigenvalues of the adjacency matrix A(G) and the signless Laplacian matrix Q(G). Based on the skewness, thickness, and crossing number, we establish a lower bound for the graph’s second largest adjacency and signless Laplacian eigenvalues. We also determine a lower bound for these graph properties in terms of the second largest adjacency and signless Laplacian eigenvalues of regular graphs.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Machasri Manickam, Kalyani Desikan
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.