Work

Inverse Odd Neighbor in D^{-1}^c Domination Number in Graphs

Year: 2024

Type: article

Abstract: In this paper, we introduce a new definition of an inverse domination number called an inverse odd neighbor in D^{- 1}^c domination number. For any connected graph G, D is a minimum odd neighbor in D^c dominating set if D^c has a dominating set, say D^{-1}, with vertices dominating to an odd number of vertices in D^{-1}^c. This set is called an inverse odd neighbor in D^{-1}^c domination number.

Source: International journal of mathematics and computer science

DOI: 10.69793/ijmcs/01.2025/haneen

Authors: Haneen Aljanaby, Sarah Alsaebari, Fatima Awad

Institutions: University of Babylon, Al-Furat Al-Awsat Technical University, University of Kerbala

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W4403577039

FWCI:

Cites:

Cited by:

Related to: 10