Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Volume 28 (2020): Issue 3 (December 2020)
Open Access
Algorithmic Aspects of Some Variants of Domination in Graphs
J. Pavan Kumar
J. Pavan Kumar
and
P.Venkata Subba Reddy
P.Venkata Subba Reddy
| Dec 28, 2020
Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Volume 28 (2020): Issue 3 (December 2020)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Dec 28, 2020
Page range:
153 - 170
Received:
Jul 24, 2019
Accepted:
Jan 09, 2020
DOI:
https://doi.org/10.2478/auom-2020-0039
Keywords
Domination
,
NP-complete
,
Secure domination
,
Independent set
,
Complexity classes
,
APX-hard
© 2020 J. Pavan Kumar et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
J. Pavan Kumar
Department of Computer Science and Engineering, National Institute of Technology
Warangal, India
P.Venkata Subba Reddy
Department of Computer Science and Engineering, National Institute of Technology
Warangal, India