Browse > Article
http://dx.doi.org/10.7858/eamj.2010.26.3.423

DOMINATIONS ON BIPARTITE STEINHAUS GRAPHS  

Lim, Dae-Keun (DEPARTMENT OF MATHEMATICS KEIMYUNG UNIVERSITY)
Publication Information
East Asian mathematical journal / v.26, no.3, 2010 , pp. 423-427 More about this Journal
Abstract
In this paper, we give an upper bound for dominations of Steinhaus graphs, and the domination numbers of the bipartite Steinhaus graphs. Also, we give an upper bound for Nordhaus-Gaddum type result for the bipartite Steinhaus graphs.
Keywords
Steinhaus graph; generating string; bipartite graph; domination number; ${\gamma}$-set;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Bollobas, Graph Theory, Springer-Verlag, New York, 1979.
2 W. M. Dymacek, Bipartite Steinhaus graphs, Discrete Mathematics 59 (1986), 9-22.   DOI   ScienceOn
3 W. M. Dymacek and T. Whaley, Generating strings for bipartite Steinhaus graphs, Discrete Mathematics 141 (1995), no1-3, 95-107.   DOI   ScienceOn
4 W. M. Dymacek, M. Koerlin and T. Whaley, A survey of Steinhaus graphs, Proceedings of the Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithm and Applications, 313-323, Vol. 1, 1998.
5 G. J. Chang, B. DasGupta, W. M. Dymacek, M. Furer, M. Koerlin, Y. Lee and T. Wha- ley, Characterizations of bipartite Steinhaus graphs, Discrete Mathematics 199 (1999), 11-25.   DOI   ScienceOn
6 H. Harborth, Solution of Steinhaus's problem with plus and minus signs, J. Combina- torial Theory 12(A) (1972), 253-259.   DOI
7 T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
8 D. Lim, Upper bound on domination number of Steinhaus graphs, J. Inst. Nat. Sci. Vol.12, No.2 (2007), 9-14.
9 R. Stanley, Enumerative Combinatorics Vol. I, Wadsworth and Brooks/Cole, Monterey, 1986.