Edge domatic numbers of complete n- partite graphs |
| |
| Authors: | Shiow-Fen Hwang Gerard J Chang |
| |
| Institution: | 1. Department ofinformation Engineering, Feng Chia University, 40724, Taichung, Taiwan
2. Institute of Applied Mathematics, National Chiao Tung University, 30050, Hsinchu, Taiwan
|
| |
| Abstract: | An edge dominating set of a graph is a set of edgesD such that every edge not inD is adjacent to an edge inD. An edge domatic partition of a graph G =(V, E) is a collection of pairwise disjoint edge dominating sets of G whose union isE. The maximum size of an edge domatic partition of G is called the edge domatic number of G. In this paper we study the edge domatic numbers of completen-partite graphs. In particular, we give exact values for the edge domatic numbers of complete 3-partite graphs and balanced complete n-partite graphs with oddn. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
