Affiliation:
1. Departamento de Matemáticas, Facultad de Ciencias Básicas, Universidad de Antofagasta, Antofagasta 1240000, Chile
Abstract
In this paper, we introduce the concepts of Harary Laplacian-energy-like for a simple undirected and connected graph G with order n. We also establish novel matrix results in this regard. Furthermore, by employing matrix order reduction techniques, we derive upper and lower bounds utilizing existing graph invariants and vertex connectivity. Finally, we characterize the graphs that achieve the aforementioned bounds by considering the generalized join operation of graphs.
Funder
Programa Regional MathAmSud
MINEDUC-UA
Initiation Program at Research-Universidad de Antofagasta
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference25 articles.
1. Betten, A., Kohnert, A., Laue, R., and Wassermann, A. (2001). Algebraic Combinatorics and Applications, Springer.
2. The total π-electron energy saga;Gutman;Croat. Chem. Acta,2017
3. Li, X., Shi, Y., and Gutman, I. (2012). Graph Energy, Springer.
4. The energy of a graph;Gutman;Ber. Math. Statist. Sekt. Forschungsz. Graz,1978
5. On the minimum energy of regular graphs;Aashtab;Linear Algebra Appl.,2019