Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
New results on connected dominating structures in graphs
View through CrossRef
Abstract
A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating structure is a subgraph induced by the dominating set. Connected domination is a type of domination where the dominating structure is connected. Clique domination is a type of domination in graphs where the dominating structure is a complete subgraph. The clique domination number of a graph G denoted by γk(G) is the minimum cardinality among all the clique dominating sets of G. We present few properties of graphs admitting dominating cliques along with bounds on clique domination number in terms of order and size of the graph. A necessary and sufficient condition for the existence of dominating clique in strong product of graphs is presented. A forbidden subgraph condition necessary to imply the existence of a connected dominating set of size four also is found.
Springer Science and Business Media LLC
Title: New results on connected dominating structures in graphs
Description:
Abstract
A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set.
A dominating structure is a subgraph induced by the dominating set.
Connected domination is a type of domination where the dominating structure is connected.
Clique domination is a type of domination in graphs where the dominating structure is a complete subgraph.
The clique domination number of a graph G denoted by γk(G) is the minimum cardinality among all the clique dominating sets of G.
We present few properties of graphs admitting dominating cliques along with bounds on clique domination number in terms of order and size of the graph.
A necessary and sufficient condition for the existence of dominating clique in strong product of graphs is presented.
A forbidden subgraph condition necessary to imply the existence of a connected dominating set of size four also is found.
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...
Nonsplit Neighbourhood Tree Domination Number In Connected Graphs
Nonsplit Neighbourhood Tree Domination Number In Connected Graphs
: Let G = (V, E) be a connected graph. A subset D of V is called a dominating set of G if N[D] = V. The minimum cardinality of a dominating set of G is called the domination number...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
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...
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...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Dominating Cocoloring of Graphs
Dominating Cocoloring of Graphs
A -cocolouring of a graph is a partition of the vertex set into subsets such that each set induces either a clique or an independent set in . The cochromatic number of a graph is t...