"Algorithmic complexity of secure connected domination in graphs."

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam (2020)

> Home

Details and statistics

DOI: 10.1016/J.AKCEJ.2019.08.012

access: closed

type: Journal Article

metadata version: 2021-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/akcej/KumarRA20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/akcej/KumarRA20
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam:
Algorithmic complexity of secure connected domination in graphs. AKCE Int. J. Graphs Comb. 17(3): 1010-1013 (2020)

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.