Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Efficient Open Domination in Digraph Products
View through CrossRef
A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partition of V ( D ) . In this work we deal with the efficient open domination digraphs among four standard products of digraphs. We present a method for constructing the efficient open domination Cartesian product of digraphs with one fixed factor. In particular, we characterize those for which the first factor has an underlying graph that is a path, a cycle or a star. We also characterize the efficient open domination strong product of digraphs that have factors whose underlying graphs are uni-cyclic graphs. The full characterizations of the efficient open domination direct and lexicographic product of digraphs are also given.
Title: Efficient Open Domination in Digraph Products
Description:
A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partition of V ( D ) .
In this work we deal with the efficient open domination digraphs among four standard products of digraphs.
We present a method for constructing the efficient open domination Cartesian product of digraphs with one fixed factor.
In particular, we characterize those for which the first factor has an underlying graph that is a path, a cycle or a star.
We also characterize the efficient open domination strong product of digraphs that have factors whose underlying graphs are uni-cyclic graphs.
The full characterizations of the efficient open domination direct and lexicographic product of digraphs are also given.
Related Results
Exact and Approximate Digraph Bandwidth
Exact and Approximate Digraph Bandwidth
Abstract
In this paper, we introduce a directed variant of the classical Bandwidthproblem and study it from the view-point of moderately exponential time algorithms, both...
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 ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
The antiadjacency matrix is one representation matrix of a digraph. In this paper, we find the determinant and the characteristic polynomial of the antiadjacency matrix of a digrap...
Exact and Approximate Digraph Bandwidth
Exact and Approximate Digraph Bandwidth
Abstract
Note: Please see pdf for full abstract with equations.
In this paper, we introduce a directed variant of the classical BANDWIDTH problem and study it from the view...
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line digraph. There are recent studies on the relation between the characteristic polynomial o...
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...