Abstract
Graph invariants, based on the distances between the vertices of a graph, are widely used in theoretical chemistry. Recently, Gutman, Feng and Yu (Transactions on Combinatorics, 01 (2012) 27- 40) introduced the degree resistance distance of a graph G, which is defined as DR(G) = ?{u,v}?V(G)[dG(u)+dG(v)]RG(u,v), where dG(u) is the degree of vertex u of the graph G, and RG(u, v) denotes the resistance distance between the vertices u and v of the graph G. Further, they characterized n-vertex unicyclic graphs having minimum and second minimum degree resistance distance. In this paper, we characterize n-vertex bicyclic graphs having maximum degree resistance distance.
Sign-in/Register to access full text options 
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.
