
Constant Amortized Time Enumeration of Eulerian trails
In this paper, we consider enumeration problems for edgedistinct and ve...
read it

Effects of Some Operations on Domination Chromatic Number in Graphs
For a simple graph G, a domination coloring of G is a proper vertex colo...
read it

Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms
We develop a theory of graph algebras over general fields. This is model...
read it

On the chromatic numbers of signed triangular and hexagonal grids
A signed graph is a simple graph with two types of edges. Switching a ve...
read it

The Four Point Permutation Test for Latent Block Structure in Incidence Matrices
Transactional data may be represented as a bipartite graph G:=(L ∪ R, E)...
read it

Total domination in plane triangulations
A total dominating set of a graph G=(V,E) is a subset D of V such that e...
read it

Compactly Representing Uniform Interpolants for EUF using (conditional) DAGS
The concept of a uniform interpolant for a quantifierfree formula from ...
read it
VertexDomatic, EdgeDomatic and Total Domatic Number of Uniform Hypergraphs
E. J. Cockayne and S. T. Hedetniemi introduced the concept of domatic number of a graph. B. Zelinka extended the concept to the uniform hypergraphs. Further, B. Zelinka defined the concept of edgedomatic number and total edgedomatic number of a graph. In this paper, we investigate and prove some assertions in connection with vertex domatic number, edgedomatic number and total domatic number of some specific uniform hypergraphs.
READ FULL TEXT
Comments
There are no comments yet.