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

Plagiarism is checked by the leading plagiarism checker TurnItIn

Call for Paper

Volume 6 Issue 3
May-June 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

Disjoint Perfect Secure Domination in the Cartesian Product and Lexicographic Product of Graphs

Author(s) Renelyn B. Udtohan, Enrico L. Enriquez, Grace M. Estrada, Marie Cris A. Bulay-og, Edward M. Kiunisala
Country Philippines
Abstract Let G be a graph. A dominating set D⊆V(G) is called a secure dominating set of G if for each vertex u∈V(G)∖D, there exists a vertex v∈D such that uv∈ E(G) and the set (D∖{v})∪{u} is a dominating set of G. If every u∈V(G)∖D is adjacent to exactly one vertex in D, then D is a perfect secure dominating set of G. Let D be a minimum perfect secure dominating set of G. If S⊆V(G)∖D is a perfect secure dominating set of G, then S is called an inverse perfect secure dominating set of G with respect to D. A disjoint perfect secure dominating set of G is the set C=D∪S⊆V(G). Furthermore, the disjoint perfect secure domination number, denoted by γ_ps γ_ps (G), is the minimum cardinality of a disjoint perfect secure dominating set of G. A disjoint perfect secure dominating set of cardinality γ_ps γ_ps (G) is called γ_ps γ_ps-set. In this paper, we extended the study on the concept of disjoint perfect secure domination in graphs. Furthermore, we characterized the disjoint perfect secure domination in the Cartesian product and lexicographic product of two graphs.
Keywords domination, perfect secure, inverse perfect secure, disjoint, set, lexicographic, Cartesian
Field Mathematics
Published In Volume 6, Issue 2, March-April 2024
Published On 2024-04-07
Cite This Disjoint Perfect Secure Domination in the Cartesian Product and Lexicographic Product of Graphs - Renelyn B. Udtohan, 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.16564
DOI https://doi.org/10.36948/ijfmr.2024.v06i02.16564
Short DOI https://doi.org/gtqxz5
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
Copyright Permission Form and Undertaking Form Cover Page Vol 6 Isu 2 Cover Page Vol 6 Isu 1 Cover Page Vol 5 Isu 6 Research Paper Format

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