Lower bound on the weakly connected domination number of a cycle-disjoint graph
Australasian Journal of Combinatorics
Saved in:
Main Authors: | Koh, K.M., Ting, T.S., Xu, Z.L., Dong, F.M. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103519 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
by: Koh, K.M., et al.
Published: (2014) -
On the weakly connected domination number of a graph
by: XU ZHONGLIANG
Published: (2014) -
ON THE WEAKLY CONNECTED DOMINATION NUMBER OF A GRAPH
by: HANSEL LIN DAOYANG
Published: (2021) -
WEAK DOMINATION NUMBER OF GRAPHS
by: LOW THIAM ENG, TERENCE
Published: (2021) -
The sum numbers of disjoint families of graphs
by: Eder, Ermar Edhric H., et al.
Published: (2018)