Abstract
The spectral graph theory is concerned with the relationship between the spectra of specific matrices associated with a graph and the structural properties of that graph. This paper introduces a general symmetric degree adjacency of a graph G, general symmetric degree of a graph G, and complete weighted graph of a graph. Here we explore its characteristic polynomial using Sachs theorem. We also investigate the bounds for index and energy of general symmetric degree adjacency of a graph. We give two algorithms, first one to find general symmetric degree adjacency of a graph G and second one to find general symmetric degree of a graph G.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
