@article {10.3844/jmssp.2011.73.77,
article_type = {journal},
title = {Disjoint Sets in Graphs and its Application to Electrical Networks},
author = {Gaol, Ford Lumban},
volume = {7},
year = {2011},
month = {Mar},
pages = {73-77},
doi = {10.3844/jmssp.2011.73.77},
url = {https://thescipub.com/abstract/jmssp.2011.73.77},
abstract = {Problem statement: One of the well known problems in Telecommunication and Electrical
Power System is how to put Electrical Sensor Unit (ESU) in some various selected locations in the
system. Approach: This problem was modeled as the vertex covering problems in graphs. The graph
modeling of this problem as the minimum vertex covering set problem. Results: The degree covering
set of a graph for every vertex is covered by the set minimum cardinality. The minimu of a graph
cardinality of a degree covering set of a graph G is the degree covering number γP(G). Conclusion:
We show that Degree Covering Set (DCS) problem is NP-complete. In this study, we also give a linear
algorithm to solve the DCS for trees. In addition, we investigate theoretical properties of γP (T) in trees T.},
journal = {Journal of Mathematics and Statistics},
publisher = {Science Publications}
}