Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cubic Graphs with Total Domatic Number at Least Two

Published 15 Dec 2015 in math.CO and cs.DM | (1512.04748v1)

Abstract: Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of $G$. In this paper we would like to characterize the cubic graphs with total domatic number at least two.

Citations (9)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up