Abstract
The first and second general Zagreb indices of a graph G, with vertex set V and edge set E, are defined as Mk1=Σuєv d(u)k and Mk2=ΣuvєE [d(u)d(v)]k where d(v) is the degree of the vertex v of G. We present combinatorial identities, relating Mk1 and Mk2 with counts of various subgraphs contained in the graph G.
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.
