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

Identifying Secure Domination in the Cartesian and Lexicographic Products of Graphs

Author(s) Haridel Aquiles, Marie Cris A. Bulay-og, Grace M. Estrada, Carmelita M. Loquias, Enrico L. Enriquez
Country Philippines
Abstract Let G be a 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). 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. An identifying code of a graph G is an identifying secure dominating set if for each u∈V(G)\C, there exists v∈C such that uv∈E(G) and the set (C\{v})∪{u} is a dominating set of G. The minimum cardinality of an identifying secure dominating set of G, denoted by γ_s^ID, is called the identifying secure domination number of G. In this paper, the researchers initiate the study of the concept and give some important results. In particular, the researchers show some properties of the identifying secure dominating sets in the Cartesian product and lexicographic product of two connected graphs.
Keywords domination, secure, identifying, Cartesian, lexicographic
Field Mathematics > Logic
Published In Volume 6, Issue 2, March-April 2024
Published On 2024-03-08
Cite This Identifying Secure Domination in the Cartesian and Lexicographic Products of Graphs - Haridel Aquiles, Marie Cris A. Bulay-og, Grace M. Estrada, Carmelita M. Loquias, Enrico L. Enriquez - IJFMR Volume 6, Issue 2, March-April 2024. DOI 10.36948/ijfmr.2024.v06i02.14303
DOI https://doi.org/10.36948/ijfmr.2024.v06i02.14303
Short DOI https://doi.org/gtmbkd
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