Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

COMPLEMENTARY FAIR DOMINATION IN GRAPHS

View through CrossRef
In a simple, finite undirected graph G, a dominating set D is a subset of the vertex set V(G) whose closed neighbourhood is V(G). Many types of domination have been studied. The studies are based either on the nature of domination or the type of dominating set or the type of the complement of the dominating set. Interaction between dominating set and its complement is also considered. Fair domination is the domination where every vertex in the complement of a dominating set has equal number of neighbours in the dominating set. In this paper, a dominating set whose vertices have equal number of neighbours in the complement is the subject of study. The parameter γ_cof (G) is introduced and studied.
Valahia University of Targoviste - Journal of Science and Arts
Title: COMPLEMENTARY FAIR DOMINATION IN GRAPHS
Description:
In a simple, finite undirected graph G, a dominating set D is a subset of the vertex set V(G) whose closed neighbourhood is V(G).
Many types of domination have been studied.
The studies are based either on the nature of domination or the type of dominating set or the type of the complement of the dominating set.
Interaction between dominating set and its complement is also considered.
Fair domination is the domination where every vertex in the complement of a dominating set has equal number of neighbours in the dominating set.
In this paper, a dominating set whose vertices have equal number of neighbours in the complement is the subject of study.
The parameter γ_cof (G) is introduced and studied.

Related Results

Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Locating fair domination in graphs
Locating fair domination in graphs
Graphs considered here are simple, finite and undirected. A graph is denoted by [Formula: see text] and its vertex set by [Formula: see text] and edge set by [Formula: see text]. M...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background: The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex. Objective: Our a...
Domination-related colorings of n-inordinate invariant intersection graphs
Domination-related colorings of n-inordinate invariant intersection graphs
Algebraic graph theory is an intriguing field of research in which various properties of graphs constructed based on algebraic structures are studied. Interlacing two important str...
Introducing 3-Path Domination in Graphs
Introducing 3-Path Domination in Graphs
The dominating set of a graph G is a set of vertices D such that for every v ∈ V ( G ) either v ∈ D or v is adjacent to a vertex in D . The domination number, denoted γ...
Curriculum Development for FAIR Data Stewardship
Curriculum Development for FAIR Data Stewardship
Abstract The FAIR Guidelines attempts to make digital data Findable, Accessible, Interoperable, and Reusable (FAIR). To prepare FAIR data, a new data science discipl...
Determination and Analysis of Domination Numbers for Boundary Graph and Boundary Neighbour Graph Using MATLAB
Determination and Analysis of Domination Numbers for Boundary Graph and Boundary Neighbour Graph Using MATLAB
Vertex domination is a key concept in graph theory, essential for analyzing the structural properties of graphs. This study explores the use of vertex domination to determine the d...

Back to Top