On Total Covers of Block-Cactus Graphs
Let G = (V,E) be a simple graph with vertex set V and edge set E. A subset W ⊆ V ∪ E is a total covering set if every element x ∈ (V ∪ E) ∖ W is either adjacent to or incident to an element of W. The total covering problem is to find a total covering set of G. In this paper, we show that this problem can be solved in linear-time on block-cactus graphs.
Keywordstotal cover dominating set mixed dominating set block-cactus graph
Unable to display preview. Download preview PDF.
- 7.Mili, L., Baldwin, T., Phadke, A.: Phasor measurement placement for voltage and stability monitoring and control. In: Proc. of the EPRI-NSF Workshop on Application of Advanced Mathematics to Power System, San Francisco, CA (1991)Google Scholar