A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
Australasian Journal of Combinatorics
Saved in:
Main Authors: | Koh, K.M., Ting, T.S., Dong, F.M. |
---|---|
其他作者: | MATHEMATICS |
格式: | Article |
出版: |
2014
|
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/102608 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Lower bound on the weakly connected domination number of a cycle-disjoint graph
由: Koh, K.M., et al.
出版: (2014) -
GRAPHS WITH UNIQUE MINIMUM DOMINATING SET
由: LIANG CHUN
出版: (2021) -
On disjoint hamiltonian cycles in bipartite graphs
由: Briones, Ryan Louise M., et al.
出版: (2014) -
VERTEX-DISJOINT CYCLES IN K-CONNECTED TOURNAMENTS
由: CHIA HAN SIAN BARRY
出版: (2021) -
On the weakly connected domination number of a graph
由: XU ZHONGLIANG
出版: (2014)