Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Independent semitotal domination excellent graphs
View through CrossRef
A dominating set [Formula: see text] of vertices of a graph [Formula: see text] with no isolated vertices is an independent semitotal dominating set of [Formula: see text] if it is an independent dominating set and to each [Formula: see text] there exists a [Formula: see text] at a distance of exactly two. The minimum and maximum cardinality of a independent semitotal dominating set are called the independent semitotal domination number [Formula: see text] and upper independent semitotal domination number [Formula: see text] of [Formula: see text], respectively. A graph [Formula: see text] is said to be [Formula: see text]-excellent if every vertex of [Formula: see text] is in some [Formula: see text]-set of [Formula: see text]. A graph [Formula: see text] is said to be [Formula: see text]-just excellent if for each [Formula: see text], there is a unique [Formula: see text]-set of [Formula: see text] containing [Formula: see text]. In this paper, we initiate a study of [Formula: see text]-excellent and [Formula: see text]-just excellent graphs.
World Scientific Pub Co Pte Ltd
Title: Independent semitotal domination excellent graphs
Description:
A dominating set [Formula: see text] of vertices of a graph [Formula: see text] with no isolated vertices is an independent semitotal dominating set of [Formula: see text] if it is an independent dominating set and to each [Formula: see text] there exists a [Formula: see text] at a distance of exactly two.
The minimum and maximum cardinality of a independent semitotal dominating set are called the independent semitotal domination number [Formula: see text] and upper independent semitotal domination number [Formula: see text] of [Formula: see text], respectively.
A graph [Formula: see text] is said to be [Formula: see text]-excellent if every vertex of [Formula: see text] is in some [Formula: see text]-set of [Formula: see text].
A graph [Formula: see text] is said to be [Formula: see text]-just excellent if for each [Formula: see text], there is a unique [Formula: see text]-set of [Formula: see text] containing [Formula: see text].
In this paper, we initiate a study of [Formula: see text]-excellent and [Formula: see text]-just excellent graphs.
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...
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...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
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 γ...
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...
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...