Name
Abstract | ||
|---|---|---|
Three numerical invariants of graphs concerning domination, which are named the signed domination number @c\"s, the k-subdomination number @c\"k\"s and the signed total domination number @c\"s\"t, are studied in this paper. For any graph, some lower bounds on @c\"s, @c\"k\"s and @c\"s\"t are presented, some of which generalize several known lower bounds on @c\"s, @c\"k\"s and @c\"s\"t, while others are considered as new. It is also shown that these bounds are sharp. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2006.09.050 | Discrete Mathematics |
Keywords | Field | DocType |
signed domination number,k -subdomination number,signed total domination number,k-subdomination number,lower bound,domination number | Discrete mathematics,Graph,Combinatorics,Upper and lower bounds,Invariant (mathematics),Domination analysis,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 10 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.48 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weidong Chen | 1 | 13 | 2.70 |
| Enmin Song | 2 | 176 | 24.53 |