2010
DOI: 10.7494/opmath.2010.30.1.37
|View full text |Cite
|
Sign up to set email alerts
|

Dominatind sets and domination polynomials of certain graphs. II

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
15
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 30 publications
(15 citation statements)
references
References 5 publications
0
15
0
Order By: Relevance
“…We shall prove the result in a graph with n edges. By Theorem 2.5, To prove our next result, we make use of the following Theorem [2].…”
Section: P T D P T D P T D P Tmentioning
confidence: 99%
See 1 more Smart Citation
“…We shall prove the result in a graph with n edges. By Theorem 2.5, To prove our next result, we make use of the following Theorem [2].…”
Section: P T D P T D P T D P Tmentioning
confidence: 99%
“…is number of dominating sets of G of cardinality t. Domination polynomial was initiated by Arocha et al [4] and later studied by Alikhani et al [1], [2] and [3]. Analogously, edge domination polynomial was studied by Askari et al [5].…”
Section: Introductionmentioning
confidence: 99%
“…And the connected dominating set and connected domination polynomial was introduced in [9]. For more information and motivation of domination polynomial and connected domination polynomial refer to [1,2,3,4,7,10,11,13,14,15].…”
Section: Introductionmentioning
confidence: 99%
“…The desire to make a similar study on the work of the authors in [2,4,5,8] on graphs polynomials motivated the researchers to try this investigation.…”
Section: Introductionmentioning
confidence: 99%