On the α-labeling number of bipartite graphs
Abstract
We show that if G is the vertex-disjoint union of graphs with α-labelings, or if G is a comet, then there exists a graph H with an α-labeling such that H decomposes into two copies of G.
Published
2000-06-09
How to Cite
El-Zanati, Saad, Vanden Eynden, Charles, & Fu, Hung-Lin. (2000). On the α-labeling number of bipartite graphs. Utilitas Mathematica, 58. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/171
Issue
Section
Articles
