International Journal For Multidisciplinary Research

E-ISSN: 2582-2160   •   Impact Factor: 9.24

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Call for Paper Volume 7, Issue 4 (July-August 2025) Submit your research before last 3 days of August to publish your research paper in the issue of July-August.
Submit Research Paper Join as a Reviewer

Plagiarism is checked by the leading plagiarism checker TurnItIn

Call for Paper

Volume 7 Issue 4
July-August 2025

Submit your research paper

Indexing Partners
Academia Advanced Sciences Index Bielefeld Academic Search Engine CiteSeer DRJI Google Scholar Independent Search Engine & Directory Network ISI (International Scientific Indexing) Issuu Mendeley Research Networks
RefSeek ResearcherId - Thomson Reuters ResearchGate Scirus Scribd Semantic Scholar UTeM - Universiti Teknikal Malaysia Melaka Wiki for Call for Papers WorldCat Zenodo

Identifying Inverse Domination in Graphs

Author(s) Rhia Mae Charis Ompoy, Margie Baterna, Grace Estrada, Mark Kenneth Engcot, Enrico Enriquez
Country Philippines
Abstract Let G=(V(G),E(G)) be a nontrivial connected simple graph. A subset S of V(G) is a dominating set of G if for every v∈V(G)∖S, there exists x∈S such that xv ∈E(G). Let D be a minimum dominating set of G. If S⊆V(G)\D is a dominating set of G, then S is called an inverse dominating set with respect to D. The inverse domination number of G is the minimum cardinality of an inverse dominating set of G, denoted by γ^(-1) (G). An identifying code of a graph G is a dominating set C⊆V(G) such that for every v ∈ V(G), N_G [v] ∩ C is distinct. The minimum cardinality of an identifying code of G, denoted by γ^ID (G), is called the identifying code number of G. An inverse dominating set S⊆V(G)∖D is an identifying inverse dominating set of G if for every v∈V(G), N_G [v] ∩ C is distinct. The minimum cardinality of an identifying inverse dominating set of G, denoted by γ^(ID(-1)) (G), is called the identifying inverse domination number of G. In this paper, we initiate the study of the concept and we show the existence of a connected graph G with |V(G)| = n and γ^(ID(-1)) (G) = k for all positive integer k. Further, we give the identifying inverse domination number of a path graph.
Keywords dominating set, identifying code, inverse dominating set, identifying inverse dominating set
Field Mathematics
Published In Volume 7, Issue 3, May-June 2025
Published On 2025-06-28
View / Download PDF File

Share this



E-ISSN 2582-2160
CrossRef

CrossRef DOI is assigned to each research paper published in our journal.

IJFMR DOI prefix is
10.36948/ijfmr

Downloads
Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 7 Isu 3Cover Page Vol 7 Isu 2Cover Page Vol 7 Isu 1

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA Open Access

About IJFMR
Fees & Payment
Current Issue
Publication Archive 		Submit Research Paper
Track Submission Status
Publication Guidelines
Publication Ethics
Peer Review & Plagiarism 		Join as a Reviewer
Editors & Reviewers
Reviewer Referral Program
Get Reviewer Membership Certi. 		Website/Journal Policies
Usage Policy
Content Policies
Privacy Policy
Contact Us +91-9687-828-838 editor@ijfmr.com