On the total domatic number of regular graphs
A set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domatic number of a graph G is the maximum number of total dominating sets into which the vertex set of G can be partitioned. We show that th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2012-03-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=760&_ob=362cc9c41ad1def424bd149103450c49&fileName=full_text.pdf |
| id |
doaj-1226c8fd2aa74158906b6c8ef4bf4644 |
|---|---|
| record_format |
Article |
| spelling |
doaj-1226c8fd2aa74158906b6c8ef4bf46442020-11-24T20:59:51ZengUniversity of IsfahanTransactions on Combinatorics2251-86572251-86652012-03-01114551On the total domatic number of regular graphsH. AramS.M. SheikholeslamiL. VolkmannA set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domatic number of a graph G is the maximum number of total dominating sets into which the vertex set of G can be partitioned. We show that the total domatic number of a random r-regular graph is almost surely at most r http://www.combinatorics.ir/?_action=showPDF&article=760&_ob=362cc9c41ad1def424bd149103450c49&fileName=full_text.pdftotal dominating settotal domination numbertotal domatic numberRegular graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
H. Aram S.M. Sheikholeslami L. Volkmann |
| spellingShingle |
H. Aram S.M. Sheikholeslami L. Volkmann On the total domatic number of regular graphs Transactions on Combinatorics total dominating set total domination number total domatic number Regular graph |
| author_facet |
H. Aram S.M. Sheikholeslami L. Volkmann |
| author_sort |
H. Aram |
| title |
On the total domatic number of regular graphs |
| title_short |
On the total domatic number of regular graphs |
| title_full |
On the total domatic number of regular graphs |
| title_fullStr |
On the total domatic number of regular graphs |
| title_full_unstemmed |
On the total domatic number of regular graphs |
| title_sort |
on the total domatic number of regular graphs |
| publisher |
University of Isfahan |
| series |
Transactions on Combinatorics |
| issn |
2251-8657 2251-8665 |
| publishDate |
2012-03-01 |
| description |
A set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domatic number of a graph G is the maximum number of total dominating sets into which the vertex set of G can be partitioned. We show that the total domatic number of a random r-regular graph is almost surely at most r |
| topic |
total dominating set total domination number total domatic number Regular graph |
| url |
http://www.combinatorics.ir/?_action=showPDF&article=760&_ob=362cc9c41ad1def424bd149103450c49&fileName=full_text.pdf |
| work_keys_str_mv |
AT haram onthetotaldomaticnumberofregulargraphs AT smsheikholeslami onthetotaldomaticnumberofregulargraphs AT lvolkmann onthetotaldomaticnumberofregulargraphs |
| _version_ |
1716781161316876288 |