2017
DOI: 10.17654/dm018010057
|View full text |Cite
|
Sign up to set email alerts
|

The Co-Connected Domination Polynomial of a Graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0
1

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 0 publications
0
2
0
1
Order By: Relevance
“…is the vertex connected domination number of We have: If (1,3), (1,4), (1,5)}|=4, If (1,2,4), (1,2,5), (1,3,4), (1,3,5), ( 1,4,5)}|=6, If (1,2,3,4), (1,2,3,5), (1,2,4,5), (1,3,4,5)}|=4, If…”
Section: Vertex Connected Domination Polynomial Of Complete Coalescence Graphsunclassified
See 2 more Smart Citations
“…is the vertex connected domination number of We have: If (1,3), (1,4), (1,5)}|=4, If (1,2,4), (1,2,5), (1,3,4), (1,3,5), ( 1,4,5)}|=6, If (1,2,3,4), (1,2,3,5), (1,2,4,5), (1,3,4,5)}|=4, If…”
Section: Vertex Connected Domination Polynomial Of Complete Coalescence Graphsunclassified
“…2. ( : , 4) (1,2,4,5), (1,3,4,5), (1,4,5,6), (1,4,5,7), (1,4,5,8), (2,3,4,5), (2,4,5,6), (2,4,5,7), (2,4,5,8), (3,4,5,6), (3,4,5,7), (3,4,5,8)…”
Section: Vertex Connected Domination Polynomial Of Complete Coalescence Graphsmentioning
confidence: 99%
See 1 more Smart Citation