Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Point-set domination number of a semigraph
View through CrossRef
A semigraph is a generalization of a graph, and point-set domination is a generalization of domination. The notion of a semigraph is the generalization of a graph, which is different from the generalization of graphs called hypergraphs. In this paper, we characterize the point-set domination number for certain classes of semigraphs, as well as a realization theorem connecting the point-set domination number, a-domination number, and independence number for the semigraph. We find a Nordhaus–Gaddum-type result involving the point-set domination of the semigraph.
World Scientific Pub Co Pte Ltd
Title: Point-set domination number of a semigraph
Description:
A semigraph is a generalization of a graph, and point-set domination is a generalization of domination.
The notion of a semigraph is the generalization of a graph, which is different from the generalization of graphs called hypergraphs.
In this paper, we characterize the point-set domination number for certain classes of semigraphs, as well as a realization theorem connecting the point-set domination number, a-domination number, and independence number for the semigraph.
We find a Nordhaus–Gaddum-type result involving the point-set domination of the semigraph.
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...
Simple Acyclic Graphoidal Covering Number In A Semigraph
Simple Acyclic Graphoidal Covering Number In A Semigraph
A simple graphoidal cover of a semigraph is a graphoidal cover of such that any two paths in have atmost one end vertex in common. The minimum cardinality of a simple graphoida...
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...
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 Minimum Covering Energy of Semigraph
On Minimum Covering Energy of Semigraph
A compromise between the concept of graph and hypergraph is semigraph. This paper introduced the concept of minimum covering matrix and minimum covering energy of a semigraph G. Th...
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 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:...
Upper g- Eccentric Domination in Fuzzy Graphs
Upper g- Eccentric Domination in Fuzzy Graphs
Objectives: To introduce a contemporary aspect notorious as upper g-eccentric point set, upper g-eccentric number, upper g-eccentric dominating set, upper g-eccentric domination nu...