Inverse secure domination in graphs

Enrico L. Enriquez; Edward M. Kiunisala

← Back to search

Inverse secure domination in graphs

Closed

Enrico L. Enriquez, Edward M. Kiunisala

2016 Global Journal of Pure and Applied Mathematics Vol. 12 Issue 1 Article Cited by 2

Abstract

In this paper, we show that every integers k, m, and n with 1 ≤ k ≤ m < n is realizable as inverse domination number, inverse secure domination number, and order of G respectively. Further, we give the characterization of the inverse secure dominating set with inverse secure domination number of one and two and give some important results. © Research India Publications.

Affiliations

Department of Mathematics, School of Arts and Sciences, University of San Carlos, Cebu City, 6000, Philippines

Research at a Glance

Research at a Glance

Topics & SDG Alignment

Collaboration

Author Profile (Selected)

References Overview

Journal & Source

Metadata & Integrity