期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2016
卷号：13
期号：2
页码：107-111
DOI：10.1016/j.akcej.2016.06.004
语种：English
出版社：Elsevier
摘要：AbstractLetGbe a graph with vertex setV(G)and edge setE(G). A vertex labelingf:V(G)→Z2induces an edge labelingf+:E(G)→Z2defined byf+(xy)=f(x)+f(y), for each edgexy∈E(G). Fori∈Z2, letvf(i)=|{v∈V(G):f(v)=i}|andef(i)=|{e∈E(G):f+(e)=i}|. We sayfis friendly if|vf(0)−vf(1)|≤1. We sayGis cordial if|ef(1)−ef(0)|≤1for a friendly labelingf. The setFI(G)={|ef(1)−ef(0)|:f is friendly}is called the friendly index set ofG. In this paper, we investigate the friendly index sets of the edge-gluing of a complete graphKnandncopies of cyclesC3. The cordiality of the graphs is also determined.
