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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call