2023
DOI: 10.47191/ijmcr/v11i8.08
|View full text |Cite
|
Sign up to set email alerts
|

Gourava Domination Indices of Graphs

V.R. Kulli

Abstract: In this paper, we introduce the first and second Gourava domination indices and their corresponding polynomials of a graph. Furthermore, we compute these indices and their corresponding polynomials for some standard graphs, French windmill graphs, friendship graphs and book graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…Recently some Gourava indices were studied, for example, in [12][13][14][15][16][17][18][19][20][21][22][23][24][25].…”
Section: mentioning
confidence: 99%
“…Recently some Gourava indices were studied, for example, in [12][13][14][15][16][17][18][19][20][21][22][23][24][25].…”
Section: mentioning
confidence: 99%
“…Recently, some Gourava indices were studied in [22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39].…”
Section: Introductionmentioning
confidence: 99%
“…The domination degree   d du [15] of a vertex u in a graph G is defined as the number of minimal dominating sets of G which contains u. Recently, some domination indices were studied, for example, in [16,17,18,19,20].…”
Section: Introductionmentioning
confidence: 99%