Construction for trees without domination critical vertices
Denote by γ(G) the domination number of graph G. A vertex v of a graph G is called fixed if v belongs to every minimum dominating set of G, and bad if v does not belong to any minimum dominating set of G. A vertex v of G is called critical if γ(G−v)<γ(G). By using these notations of vertices, we...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-07-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2021621?viewType=HTML |