2012
DOI: 10.9790/5728-0340414
|View full text |Cite
|
Sign up to set email alerts
|

Dominating Sets and Domination Polynomials of Square Of Cycles

Abstract: Let G = (V, E) be a simple graph. A set S  V is a dominating set of G, if every vertex in V-S is adjacent to atleast one vertex in S. Let

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 1 publication
0
0
0
Order By: Relevance