ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

THE CORDIAL LABELING FOR THE CARTESIAN PRODUCT BETWEEN PATHS AND CYCLES

Journal: INTERNATIONAL JOURNAL OF RESEARCH -GRANTHAALAYAH (Vol.8, No. 3)

Publication Date:

Authors : ; ; ; ;

Page : 331-341

Keywords : Cartesian Product; Cordial; Cycle; Graph; Labeling; Path;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this paper we show the Cartesian product of a path and a cycle or vice versa are always cordial under some conditions. Also, we prove that the Cartesian product of two paths is cordial.

Last modified: 2020-07-18 20:31:27