Abstract
Let G = (V,E), V = {v1, v2,..., vn} be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 ≥ d2 ≥ ··· ≥ dn > 0, di = d(vi). The general sumconnectivity coindex is defined as Ha(G) = ∑i j (di + dj) a , while multiplicative first Zagreb coindex is defined as P1(G) = ∏i j (di + dj). Here a is an arbitrary real number, and i j denotes that vertices i and j are not adjacent. Some relations between Ha(G) and P1(G) are obtained.
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 callMore From: Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics
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.
