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...
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
Research on production of some natural food colorings
Research on production of some natural food colorings
<p class="03Abstract">Steming from the general trend of the world in the use of products from nature, some basic natural food colorings have been produced, including the red ...
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...
Independent and total domination in antiprism graphs from convex polytopes
Independent and total domination in antiprism graphs from convex polytopes
Let [Formula: see text] be a connected graph. Antiprism graphs, defined as the skeletons of antiprism-shaped convex polytopes, consist of [Formula: see text] vertices and [Formula:...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Mixed Graph Colorings: A Historical Review
Mixed Graph Colorings: A Historical Review
This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains bot...
Inductive graph invariants and approximation algorithms
Inductive graph invariants and approximation algorithms
We introduce and study an inductively defined analogue [Formula: see text] of any increasing graph invariant [Formula: see text]. An invariant [Formula: see text] is increasing if ...