• NOTE ON THE BOUNDS FOR THE DEGREE SUM ENERGY OF A GRAPH, DEGREE SUM ENERGY OF A COMMON NEIGHBORHOOD GRAPH AND TERMINAL DISTANCE ENERGY OF A GRAPH

D. S. REVANKAR*, M. M. PATIL, S. P. HANDE

Abstract


Let G be connected graph with n vertices. The concept of degree sum matrix DS(G) of a simple graph G is introduced by H. S. Ramane et.al. [2]. And the degree sum energy EDS(G) [2] is defined by the sum of the absolute values of eigenvalues of the degree sum matrix DS(G) of G. The degree sum energy of a common neighborhood graph G [4] is defined by the sum of the absolute values of eigenvalues of the degree sum matrix of a common neighborhood graph DS[con(G)]. The terminal distance energy ET(G) of a graph [3] is defined by the sum of the absolute values of eigenvalues of the terminal distance matrix T(G) of a connected graph G. In this paper we modify upper bounds for the above defined energies.


Keywords


Degree sum matrix, Eigenvalues, Common neighborhood graph, Congraph, Energy of a graph, Terminal distance energy.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/