"Algorithmic complexity of weakly connected Roman domination in graphs."

Chakradhar Padamutham, P. Venkata Subba Reddy, Khandelwal Himanshu (2022)

> Home

Details and statistics

DOI: 10.1142/S1793830921501251

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dmaa/PadamuthamRH22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmaa/PadamuthamRH22
Chakradhar Padamutham, P. Venkata Subba Reddy, Khandelwal Himanshu:
Algorithmic complexity of weakly connected Roman domination in graphs. Discret. Math. Algorithms Appl. 14(3): 2150125:1-2150125:14 (2022)

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.