ON k-CORDIALITY OF CYCLES,CROWNS AND WHEELS

TAO Ruihua

系统科学与复杂性(英文) ›› 1998, Vol. 11 ›› Issue (3) : 227-229.

PDF(138 KB)
PDF(138 KB)
系统科学与复杂性(英文) ›› 1998, Vol. 11 ›› Issue (3) : 227-229.
论文

ON k-CORDIALITY OF CYCLES,CROWNS AND WHEELS

    TAO Ruihua
作者信息 +

ON k-CORDIALITY OF CYCLES,CROWNS AND WHEELS

    TAO Ruihua
Author information +
文章历史 +

摘要

A graph G is called A-cordial if there is a vertex labelling f of G with elements from A...

Abstract

A graph G is called A-cordial if there is a vertex labelling f of G with elements from A...

关键词

ON k-CORDIALITY OF CYCLES / CROWNS AND WHE

Key words

ON k-CORDIALITY OF CYCLES / CROWNS AND WHEELS

引用本文

导出引用
TAO Ruihua. ON k-CORDIALITY OF CYCLES,CROWNS AND WHEELS. 系统科学与复杂性(英文), 1998, 11(3): 227-229
TAO Ruihua. ON k-CORDIALITY OF CYCLES,CROWNS AND WHEELS. Journal of Systems Science and Complexity, 1998, 11(3): 227-229
PDF(138 KB)

179

Accesses

0

Citation

Detail

段落导航
相关文章

/