Abstract

This paper discusses the integer cordial labeling on the graph nF_(m_i)(n-1)P_t when m_i is even or odd. The graph nF_m(n-1)P_t is obtained from n friendship graphs connected by n-1 paths P_t at vertices other than the central vertex of the graph for the i-th and i+1-th graphs where 1≤i≤n. Additionally, m_i denotes the number of copies of the cycle C_3 for each friendship graph. The main result is the integer cordial label for this graph. Furthermore, it was proved that nF_m(n-1)P_t when m_i even or odd is a graph with integer cordial labeling.

This work is licensed under a Creative Commons Attribution 4.0 License.