BibTeX record journals/corr/abs-2002-00713

download as .bib file

@article{DBLP:journals/corr/abs-2002-00713,
  author       = {Jakkepalli Pavan Kumar and
                  P. Venkata Subba Reddy and
                  S. Arumugam},
  title        = {Algorithmic Complexity of Secure Connected Domination in Graphs},
  journal      = {CoRR},
  volume       = {abs/2002.00713},
  year         = {2020},
  url          = {https://arxiv.org/abs/2002.00713},
  eprinttype    = {arXiv},
  eprint       = {2002.00713},
  timestamp    = {Sat, 12 Jun 2021 11:16:55 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-00713.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.