Critical graphs with respect to total domination and connected domination
A graph G is said to be k-γt -critical if the total domination number γt(G)= k and γt (G + uv) < k for every uv /∈ E(G). A k-γc-critical graph G is a graph with the connected domination number γc(G) = k and γc(G + uv) < k for every uv /∈ E(G). Further, a k-tvc graph is a graph with γt(G) = k a...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Centre for Discrete Mathematics and Computing
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/15897 |