Abstract
The eccentricity resistance-distance sum of a connected graph G is defined as ξR(G)=∑u,v∈V(G)(ε(u)+ε(v))R(u,v), where ε(u) is the eccentricity of the vertex u and R(u,v) is the resistance distance between u and v in graph G. Let Cat(n;t) be the set of all cacti possessing n vertices and t cycles. In this paper, some transformations of a connected graph are studied, which is mainly focused on the monotonicity on the eccentricity resistance-distance sum. By the transformation, the extremal graphs with maximum ξR-value of Cat(n;t) are characterized.
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.
