Abstract

Recently, Wang et al. (2017) introduced two new operations of graphs. In this paper the upper bounds of the multiplicative Zagreb indices of the two newly proposed operations of graphs are derived.

Highlights

  • Throughout the paper we consider only simple finite graphs

  • The degree of a vertex u ∈ V (G) is denoted by dG(u), if their is no confusion we write it as d(u)

  • Like many other topological indices, studies related to Multiplicative Zagreb indices and coindices of various graph operations [1, 2, 3, 13]

Read more

Summary

Introduction

Throughout the paper we consider only simple finite graphs. V (G) and E(G) are respectively the set of vertices and set of edges of a graph G. In this paper the upper bounds of the multiplicative Zagreb indices of the two newly proposed operations of graphs are derived. The first and second Zagreb indices of a graph G are defined as

Results
Conclusion

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 call

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.