Abstract

A graph is provided with a specific degree of vertices. The Randic matrix of the graph is provided as a matrix of specific ratio whose entries are given by a specific equation. The energy of the graph includes the sum of absolute values of a set of eigen values of the Randic matrix. This chapter explores the concept of m-shadow, extended m-splitting, double cover, and extended double cover of the graph. The adjacency matrix of the graph is a symmetric matrix of order of a specific number. A set of eigen values of the symmetric matrix of order of the specific number is a real number with their sum zero. The concept of Randic energy is one of the concepts which is a frontier between graph theory and chemistry. The chapter investigates the Randic energy of larger graphs obtained from standard graphs by means of various graph operations.

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

Disclaimer: 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.