Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Some bounds for the captive domination number of graphs
View through CrossRef
A proper subset [Formula: see text] of vertices in the graph [Formula: see text] is a captive dominating set if it is a total dominating set and each vertex in [Formula: see text] dominates at least one vertex which does not belong to [Formula: see text]; also, the captive domination number of [Formula: see text], denoted by [Formula: see text], is the cardinality of a minimum captive dominating set of [Formula: see text]. In [M. N. Al-Harere, A. A. Omran and A. T. Breesam, Captive domination in graphs, Discrete Math. Algorithms Appl. 12(6) (2020) 2050076], Al-Harere et al., presented some lower and upper bounds for the captive domination number of [Formula: see text], using the number of vertices and edges. Here, we present some upper bounds for [Formula: see text], using independence number and clique number. Also, the captive domination number of split graphs is studied. Among other results, some lower bounds for the captive domination number, in terms of maximum degree and the number of vertices with maximum degree, are presented.
World Scientific Pub Co Pte Ltd
Title: Some bounds for the captive domination number of graphs
Description:
A proper subset [Formula: see text] of vertices in the graph [Formula: see text] is a captive dominating set if it is a total dominating set and each vertex in [Formula: see text] dominates at least one vertex which does not belong to [Formula: see text]; also, the captive domination number of [Formula: see text], denoted by [Formula: see text], is the cardinality of a minimum captive dominating set of [Formula: see text].
In [M.
N.
Al-Harere, A.
A.
Omran and A.
T.
Breesam, Captive domination in graphs, Discrete Math.
Algorithms Appl.
12(6) (2020) 2050076], Al-Harere et al.
, presented some lower and upper bounds for the captive domination number of [Formula: see text], using the number of vertices and edges.
Here, we present some upper bounds for [Formula: see text], using independence number and clique number.
Also, the captive domination number of split graphs is studied.
Among other results, some lower bounds for the captive domination number, in terms of maximum degree and the number of vertices with maximum degree, are presented.
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...
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...
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...
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...
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:...
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...
Some new results on captive dominating sets in graphs
Some new results on captive dominating sets in graphs
A dominating set [Formula: see text] is said to be a captive dominating set of [Formula: see text] if [Formula: see text] has no isolated vertex ([Formula: see text] is a total dom...
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...