Identifying Inverse Dominationin the Join of Two Graphs
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 give the identifying inverse dominating set and the identifying inverse domination number in the join of two connected nontrivial graphs.
Authors
- Grace M. Estrada -
- Enrico L. Enriquez (ORCID: https://orcid.org/0000-0002-1521-156X)
- Margie L. Baterna
- Mark Kenneth C. Engcot
- Rhia Mae Charis Ompoy
Publication Details
- Journal
- International Journal of Latest Engineering Research and Applications (IJLERA)
- Published
- 2025-07-04
- DOI
- https://doi.org/10.56581/ijlera.10.06.11-18
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Division of Human Resource Development