4 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 2 cited
Counting the Number of Minimum Roman Dominating Functions of a Graph
Zheng Shi, Khee Meng Koh
We provide two algorithms counting the number of minimum Roman dominating functions of a graph on n vertices in O(1.5673^n) time and polynomial space. We also show that the time co…
math.CO2002★ 4 cited
Maximal Independent Sets In Graphs With At Most r Cycles
Chee Ying Goh, Khee Meng Koh, Bruce E. Sagan +1
We find the maximum number of maximal independent sets in two families of graphs: all graphs with vertices and at most cycles, and all such graphs that are also connected.…