ArticleOriginal scientific text

Title

γ-labelings of complete bipartite graphs

Authors 1, 1, 1

Affiliations

  1. Department of Mathematics, University of Wisconsin Oshkosh, Oshkosh, Wisconsin 54901, USA

Abstract

Explicit formulae for the γ-min and γ-max labeling values of complete bipartite graphs are given, along with γ-labelings which achieve these extremes. A recursive formula for the γ-min labeling value of any complete multipartite is also presented.

Keywords

γ-labelings, bipartite graphs, multipartite graphs

Bibliography

  1. G. Chartrand, D. Erwin, D.W. VanderJagt and P. Zhang, γ-labelings of graphs, Bull. Inst. Combin. Appl. 44 (2005) 51-68.
  2. G. Chartrand, D. Erwin, D. VanderJagt and P. Zhang, γ-labelings of trees, Discuss. Math. Graph Theory 25 (2005) 363-383, doi: 10.7151/dmgt.1289.
  3. C.M. da Fonseca, V. Saenpholphat and P. Zhang, The γ-spectrum of a graph, Ars. Combin., to appear.
  4. V. Saenpholphat, F. Okamoto and P. Zhang, On γ-labelings on oriented graphs, Math. Bohem. 132 (2007) 185-203.
Pages:
45-54
Main language of publication
English
Received
2008-09-10
Accepted
2008-12-29
Published
2010
Exact and natural sciences