[HTML][HTML] The corona between cycles and paths
A graph is said to be cordial if it has a 0–1 labeling that satisfies certain properties. The
corona G 1⨀ G 2 of two graphs G 1 (with n 1 vertices and m 1 edges) and G 2 (with n 2
vertices and m 2 edges) is defined as the graph obtained by taking one copy of G 1 and n 1
copies of G 2, and then joining the ith vertex of G 1 with an edge to every vertex in the ith
copy of G 2. In this paper we investigate the cordiality of the corona between cycles C n and
paths P n, namely C n⨀ P m.
corona G 1⨀ G 2 of two graphs G 1 (with n 1 vertices and m 1 edges) and G 2 (with n 2
vertices and m 2 edges) is defined as the graph obtained by taking one copy of G 1 and n 1
copies of G 2, and then joining the ith vertex of G 1 with an edge to every vertex in the ith
copy of G 2. In this paper we investigate the cordiality of the corona between cycles C n and
paths P n, namely C n⨀ P m.
A graph is said to be cordial if it has a 0–1 labeling that satisfies certain properties. The corona G 1⨀ G 2 of two graphs G 1 (with n 1 vertices and m 1 edges) and G 2 (with n 2 vertices and m 2 edges) is defined as the graph obtained by taking one copy of G 1 and n 1 copies of G 2, and then joining the ith vertex of G 1 with an edge to every vertex in the ith copy of G 2. In this paper we investigate the cordiality of the corona between cycles C n and paths P n, namely C n⨀ P m.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果