Cubic Graphs with Total Domatic Number at Least Two
Combinatorics
2015-12-16 v1 Discrete Mathematics
Abstract
Let be a graph. A total dominating set of is a set of vertices of such that every vertex is adjacent to at least one vertex in . The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of . In this paper we would like to characterize the cubic graphs with total domatic number at least two.
Cite
@article{arxiv.1512.04748,
title = {Cubic Graphs with Total Domatic Number at Least Two},
author = {Saieed Akbari and Mohammad Motiei and Sahand Mozaffari and Sina Yazdanbod},
journal= {arXiv preprint arXiv:1512.04748},
year = {2015}
}
Comments
6 pages, 5 figures