A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set

Australasian Journal of Combinatorics

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Koh, K.M., Ting, T.S., Dong, F.M.
مؤلفون آخرون: MATHEMATICS
التنسيق: مقال
منشور في: 2014
الوصول للمادة أونلاين:http://scholarbank.nus.edu.sg/handle/10635/102608
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
المؤسسة: National University of Singapore
id sg-nus-scholar.10635-102608
record_format dspace
spelling sg-nus-scholar.10635-1026082024-11-11T04:23:08Z A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set Koh, K.M. Ting, T.S. Dong, F.M. MATHEMATICS Australasian Journal of Combinatorics 54 2 177-187 2014-10-28T02:27:38Z 2014-10-28T02:27:38Z 2012 Article Koh, K.M.,Ting, T.S.,Dong, F.M. (2012). A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. Australasian Journal of Combinatorics 54 (2) : 177-187. ScholarBank@NUS Repository. 10344942 http://scholarbank.nus.edu.sg/handle/10635/102608 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
description Australasian Journal of Combinatorics
author2 MATHEMATICS
author_facet MATHEMATICS
Koh, K.M.
Ting, T.S.
Dong, F.M.
format Article
author Koh, K.M.
Ting, T.S.
Dong, F.M.
spellingShingle Koh, K.M.
Ting, T.S.
Dong, F.M.
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
author_sort Koh, K.M.
title A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
title_short A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
title_full A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
title_fullStr A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
title_full_unstemmed A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
title_sort characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
publishDate 2014
url http://scholarbank.nus.edu.sg/handle/10635/102608
_version_ 1821191652979507200