Independent dominating sets and idomatic partitions in direct products of four complete graphs

@inproceedings{Klavzar2009IndependentDS,
  title={Independent dominating sets and idomatic partitions in direct products of four complete graphs},
  author={Sandi Klavzar and Gasper Mekis},
  year={2009}
}
Independent dominating sets in the direct product of four complete graphs are considered. Possible types of such sets are classified. The sets in which every pair of vertices agree in exactly one coordinate, called T1-sets, are explicitly described. It is proved that the direct product of four complete graphs admits a partition into T1-sets if and only if each factor has at least three vertices and the orders of at least two factors are divisible by 3. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Independent domatic partitioning or fall coloring of strongly chordal graphs

  • J. Lyle, N. Drake, R. Laskar
  • Congr. Numer. 172
  • 2005
Highly Influential
6 Excerpts

Fall colorings of graphs

  • J. E. Dunbar, S. M. Hedetniemi, +4 authors D. F. Rall
  • J. Comb. Math. Comb. Comput. 33
  • 2000
3 Excerpts

Product Graphs: Structure and Recognition

  • W. Imrich, S. Klavžar
  • Wiley, New York
  • 2000
1 Excerpt

A survey on Hedetniemi’s conjecture

  • X. Zhu
  • Taiwanese J. Math. 2
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…