On friendly index sets of the edge-gluing of complete graph and cycles
Gee-Choon Lau, Zhen-Bin Gao, Sin-Min Lee, Guang-Yi Sun · AKCE International Journal of Graphs and Combinatorics · 2016
Let be a graph with vertex set and edge set . A vertex labeling induces an edge labeling defined by , for each edge . For , let and . We say is friendly if . We say is cordial if for a friendly labeling . The set is called the friendly index set of . In this paper, we investigate the friendly index sets of the edge-gluing of a complete graph and copies of cycles . The cordiality of the graphs is also determined.