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

Restrained Inverse Domination in the Lexicographic and Cartesian Products of Two Graphs

Author(s) Wenlin Rose E. Alabastro, Enrico L. Enriquez, Katrina B. Fuentes, Grace M. Estrada, Marie Cris A. Bulay-og, Edward M. Kiunisala
Country Philippines
Abstract Let G be a connected simple graph and D be a minimum dominating set of G. A dominating set S⊆V(G)∖D is called an inverse dominating set of G with respect to D. An inverse dominating set S is called a restrained inverse dominating set of G if every vertex not in S is adjacent to a vertex in S and to a vertex in V(G)∖S. The restrained inverse domination number of G, denoted by, γ_r^((-1) ) (G), is the minimum cardinality of a restrained inverse dominating set of G. A restrained inverse dominating set of cardinality γ_r^((-1) ) (G) is called γ_r^((-1) ) (G) is called γ_r^((-1) )-set. This study is an extension of an existing research on restrained inverse domination in graphs. In this paper, we characterized the restrained inverse domination in graphs under the lexicographic and Cartesian products of two graphs.
Keywords dominating, inverse, restrained, set, lexicographic, Cartesian
Field Mathematics
Published In Volume 6, Issue 2, March-April 2024
Published On 2024-03-28
Cite This Restrained Inverse Domination in the Lexicographic and Cartesian Products of Two Graphs - Wenlin Rose E. Alabastro, Enrico L. Enriquez, Katrina B. Fuentes, 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.15681
DOI https://doi.org/10.36948/ijfmr.2024.v06i02.15681
Short DOI https://doi.org/gtppf5
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