Vertex-Domatic, Edge-Domatic and Total Domatic Number of Uniform Hypergraphs

09/06/2020
by   Smruti Prava Dash, et al.
0

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 edge-domatic number and total edge-domatic number of a graph. In this paper, we investigate and prove some assertions in connection with vertex domatic number, edge-domatic number and total domatic number of some specific uniform hypergraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2022

The geodesic cover problem for butterfly networks

A geodesic cover, also known as an isometric path cover, of a graph is a...
research
01/25/2021

Constant Amortized Time Enumeration of Eulerian trails

In this paper, we consider enumeration problems for edge-distinct and ve...
research
01/24/2022

A note on increasing paths in countable hypergraphs

An old result of Müller and Rödl states that a countable graph G has a s...
research
09/07/2019

Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms

We develop a theory of graph algebras over general fields. This is model...
research
08/24/2021

Supernodes

In this paper, we present two new concepts related to subgraph counting ...
research
10/04/2018

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)...
research
11/19/2022

Monitoring the edges of product networks using distances

Foucaud et al. recently introduced and initiated the study of a new grap...

Please sign up or login with your details

Forgot password? Click here to reset