Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Domination-related colorings of n-inordinate invariant intersection graphs
View through CrossRef
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 structural aspects of graphs namely, coloring, and domination in graphs, several domination-related colorings of graphs are introduced in the literature. In this paper, we study such domination-related colorings of algebraic graphs, called the [Formula: see text]-inordinate invariant intersection graphs and the [Formula: see text]-inordinate invariant non-intersection graphs, that are constructed based on the symmetric group.
World Scientific Pub Co Pte Ltd
Title: Domination-related colorings of n-inordinate invariant intersection graphs
Description:
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 structural aspects of graphs namely, coloring, and domination in graphs, several domination-related colorings of graphs are introduced in the literature.
In this paper, we study such domination-related colorings of algebraic graphs, called the [Formula: see text]-inordinate invariant intersection graphs and the [Formula: see text]-inordinate invariant non-intersection graphs, that are constructed based on the symmetric group.
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...
Domination on Bipolar Fuzzy Graph Operations: Principles, Proofs, and Examples
Domination on Bipolar Fuzzy Graph Operations: Principles, Proofs, and Examples
Bipolar fuzzy graphs, capable of capturing situations with both positive and negative memberships, have found diverse applications in various disciplines, including decision-making...
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...
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...