Affordable Access

Secure Resolving Sets in a Graph

Authors
  • subramanian, hemalathaa
  • arasappan, subramanian
Publication Date
Sep 27, 2018
Source
MDPI
Keywords
Language
English
License
Green
External links

Abstract

{s} is a resolving set. The secure resolving domination number is defined, and its value is found for several classes of graphs. The characterization of graphs with specific secure resolving domination number is also done.

Report this publication

Statistics

Seen <100 times