Abstract
In this paper, we compute Atom-bond connectivity index, Fourth atom-bond connectivity index, Sum connectivity index, Randic connectivity index, Geometric-arithmetic connectivity index and Fifth geometric-arithmetic connectivity index of Dutch windmill graph.
Highlights
The Dutch windmill graph is denoted by Dn(m) and it is the graph obtained by taking m copies of the cycle Cn with a vertex in common
The Dutch windmill graph is called as friendship graph if n = 3 . i.e., friendship graph Dn(m) is the graph obtained by taking m copies of the cycle C3 with a vertex in common
The atom-bond connectivity index, ABC index was one of the degree-based molecular descripters, which was introduced by Estrada et al [1] in late 1990’s
Summary
The Dutch windmill graph is denoted by Dn(m) and it is the graph obtained by taking m copies of the cycle Cn with a vertex in common. Contains (n −1) m + 1 vertices and mn edges as shown in the Figures 1-3. All graphs considered in this paper are finite, connected, loop less and without multiple edges. G = (V , E ) be a graph with n vertices and m edges. The edge connecting the vertices u and v is denoted by uv.
Sign-in/Register to view highlights & summary 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.
