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...
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...
The Minimum Superior Dominating Energy of Graphs
The Minimum Superior Dominating Energy of Graphs
Kathiresan and Marimuthu were the pioneers of superior distance in graphs. The same authors put forth the concept of superior domination in 2008. Superior distance is the shortest ...
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...
The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge
geodetic set of G if every edge of G is contained in a geodesic joining some
pair of vertices in S. The...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
The edge-to-edge geodetic domination number of a graph
The edge-to-edge geodetic domination number of a graph
Let G = (V, E) be a connected graph with at least three vertices. A set S Í E is called an edge-to-edge geodetic dominating set of G if S is both an edge-to-edge geodetic set of G ...
Conditions of Safe Dominating Set in Some Graph Families
Conditions of Safe Dominating Set in Some Graph Families
Let X be an arbitrary Banach space. For a nontrivial connected graph G and nonempty subset S \(\subseteq\) V (G), S is a safe dominating set of G if and only if S is a dominating s...