Title of article
On the α-labeling number of bipartite graphs
Author/Authors
Saad El-Zanati، نويسنده , , Hung-Lin Fu، نويسنده , , Chin-Lin Shiue، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
3
From page
241
To page
243
Abstract
In this note we show that the α-labeling number of a bipartite graph G is bounded, which proves a conjecture of Snevily.
Keywords
Bipartite graph , ?-labeling
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950355
Link To Document