• Further results on α-labeling number of graphs
2014
I n this note we show that the α-labeling number of a bipartite graph G is bounded, which proves a conjecture.
Keywords:
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI