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 6 Issue 6 November-December 2024 Submit your research before last 3 days of December to publish your research paper in the issue of November-December.
Submit Research Paper Join as a Reviewer

Plagiarism is checked by the leading plagiarism checker TurnItIn

Call for Paper

Volume 6 Issue 6
November-December 2024

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

Secure Inverse Domination in the Corona and Lexicographic Product of Two Graphs

Author(s) Jesica P. Dagodog, Enrico L. Enriquez, Grace M. Estrada, Marie Cris A. Bulay-og, Edward M. Kiunisala
Country Philippines
Abstract As secure domination and inverse domination garnered attention from various researchers, the combination of the two also raised a certain amount of curiosity. This paper aimed to investigate the secure inverse domination in graphs which is defined as follows. Let G be a connected simple graph and let D be a minimum dominating set of G. A dominating set S⊆V(G)∖D is an inverse dominating set of G with respect to D. The set S is called a secure inverse dominating set of G if for every u∈V(G)∖S, there exists v∈S such that uv∈E(G) and the set (S∖{v})∪{u} is a dominating set of G. The secure inverse domination number of G, denoted by γ_s^((-1) ) (G), is the minimum cardinality of a secure inverse dominating set of G. A secure inverse dominating set of cardinality γ_s^((-1) ) (G) is called γ_s^((-1) )-set. Particularly, the researchers examined and provided the characterization of secure inverse dominating set in the corona and lexicographic product of two graphs in this study. Moreover, the secure inverse domination number of graphs under the binary operations corona and lexicographic product were determined.
Keywords Dominating Sets, Corona of Two Graphs, Inverse Dominating Sets, Secure Dominating Sets, Lexicographic Product of Two Graphs
Field Mathematics
Published In Volume 6, Issue 2, March-April 2024
Published On 2024-04-15
Cite This Secure Inverse Domination in the Corona and Lexicographic Product of Two Graphs - Jesica P. Dagodog, Enrico L. Enriquez, Grace M. Estrada, Marie Cris A. Bulay-og, Edward M. Kiunisala - IJFMR Volume 6, Issue 2, March-April 2024. DOI 10.36948/ijfmr.2024.v06i02.16776
DOI https://doi.org/10.36948/ijfmr.2024.v06i02.16776
Short DOI https://doi.org/gtq3d5
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 6 Isu 6Cover Page Vol 6 Isu 5Cover Page Vol 6 Isu 4

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-9898-5948-55 editor@ijfmr.com