Advanced Search

Computation of connectivity indices of Kulli path windmill graph

Thumbnail

View/Open

Date

2018

Author

Kulli, Veerabhadrappa R.
Chaluvaraju, B.
Boregowda, H. S.

Metadata

Show full item record

Citation

Kulli, V. R., Chaluvaraju, B. & Boregowda, H. S. (2018). Computation of connectivity indices of Kulli path windmill graph. TWMS Journal Of Applied And Engineering Mathematics, 8(1A), 178-185.

Abstract

The Kulli path windmill graph P(m)n+1 is the graph obtained by taking m ? 2 copies of the graph K1 + Pn for n ? 4 with a vertex K1 in common. In this paper, we determine Zagreb, hyper-Zagreb, sum connectivity, general sum connectivity, Randic connectivity, General Randic connectivity, atom-bond connectivity, geometric-arithmetic, harmonic and symmetric division deg indices of Kulli path windmill graph.

Volume

8

Issue

1A

URI

http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2655
http://jaem.isikun.edu.tr/web/index.php/archive/98-vol8no1a/334

Collections

The following license files are associated with this item:

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess