Abstract
Let be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are defind, respectivly by: , and where is the degree of vertex u in G and uv is an edge of G, connecting the vertices u and v. Recently, the first and second multiplicative Zagreb indices of graph are defind by: and . The first and second Zagreb coindices of graph are defind by: and . and , named as multiplicative Zagreb coindices. In this article, we compute the first, second and the third Zagreb indices and the first and second multiplicative Zagreb indices of some graphs. The first and second Zagreb coindices and the first and second multiplicative Zagreb coindices of these graphs are also computed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.