COMPUTATION OF CONNECTIVITY INDICES OF KULLI PATH WINDMILL GRAPH

The Kulli path windmill graph [P.sup.(m).sub.n+1] is the graph obtained by taking m [greater than or equal to] 2 copies of the graph [K.sub.1] + [P.sub.n] for n [greater than or equal to] 4 with a vertex [K.sub.1] in common. In this paper, we determine Zagreb, hyper-Zagreb, sum connectivity, general...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 8; no. 1A; p. 178
Main Authors Kulli, V.R, Chaluvaraju, B, Boregowda, H.S
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.01.2018
Elman Hasanoglu
Subjects
Connectivity
Dividing (mathematics)
Graph theory
Mathematical research
Online AccessGet full text

Cover

More Information
Summary:The Kulli path windmill graph [P.sup.(m).sub.n+1] is the graph obtained by taking m [greater than or equal to] 2 copies of the graph [K.sub.1] + [P.sub.n] for n [greater than or equal to] 4 with a vertex [K.sub.1] 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.Keywords: Topological indices; Degree based connectivity indices; Windmill graph and Kulli path windmill graph.AMS Subject Classification: 05C05, 05C07, 05C35.
ISSN:2146-1147
2146-1147