default search action
"Hardness Results of Connected Power Domination for Bipartite Graphs and ..."
Pooja Goyal, Bhawani Sankar Panda (2024)
- Pooja Goyal, Bhawani Sankar Panda:
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. Int. J. Found. Comput. Sci. 35(6): 669-703 (2024)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.