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. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102608 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Lower bound on the weakly connected domination number of a cycle-disjoint graph
by: Koh, K.M., et al.
Published: (2014) -
GRAPHS WITH UNIQUE MINIMUM DOMINATING SET
by: LIANG CHUN
Published: (2021) -
On disjoint hamiltonian cycles in bipartite graphs
by: Briones, Ryan Louise M., et al.
Published: (2014) -
VERTEX-DISJOINT CYCLES IN K-CONNECTED TOURNAMENTS
by: CHIA HAN SIAN BARRY
Published: (2021) -
On the weakly connected domination number of a graph
by: XU ZHONGLIANG
Published: (2014)