Disjoint sets in graphs and its application to electrical networks

DOI10.3844/JMSSP.2011.73.77zbMATH Open1226.94026OpenAlexW2032203599MaRDI QIDQ3089062FDOQ3089062

Authors: Ford Lumban Gaol 

Publication date: 23 August 2011

Published in: Journal of Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3844/jmssp.2011.73.77

Recommendations

• Domination in Graphs Applied to Electric Power Networks
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• scientific article; zbMATH DE number 5138348
• Computing and Combinatorics
• A note on power domination in grid graphs

zbMATH Keywords

vertex coveringelectrical networksgraph modelingelectrical power systemdegree covering numberdegree covering setelectrical sensor unit

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: Disjoint sets in graphs and its application to electrical networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089062)