arXiv subjects

Khee Meng Koh

Publications and source records attributed to Khee Meng Koh.

2 recordsLinked to original sources

arXiv2014

Counting the Number of Minimum Roman Dominating Functions of a Graph

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 complexity can be reduced to O(1.5014^n) if exponential space is used. Our result is obtained by transforming the Roman domination problem into other combinatorial problems on graphs for which exact algorithms already exist.

cs.DS↗

arXiv2005

Maximal Independent Sets In Graphs With At Most r Cycles

We find the maximum number of maximal independent sets in two families of graphs: all graphs with $n$ vertices and at most $r$ cycles, and all such graphs that are also connected. In addition, we characterize the extremal graphs.

math.CO↗