An Upper Bound for the Total Restrained Domination Number of Graphs
10.1007/s00373-012-1189-4
Saved in:
Main Authors: | Koh, K.M., Maleki, Z., Omoomi, B. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102851 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Control degrees of freedom using the restraining number: Further evaluation
by: Vasudevan, S., et al.
Published: (2014) -
H-domination in graphs
by: Koh, K.M., et al.
Published: (2014) -
Structuring unreliable radio networks
by: Censor-Hillel, K., et al.
Published: (2013) -
Contour-based object detection as dominant set computation
by: Yang, X., et al.
Published: (2013) -
On the Total Set Chromatic Number of Graphs
by: Tolentino, Mark Anthony C, et al.
Published: (2022)