THE CORDIAL LABELING FOR THE CARTESIAN PRODUCT BETWEEN PATHS AND CYCLES
Journal: INTERNATIONAL JOURNAL OF RESEARCH -GRANTHAALAYAH (Vol.8, No. 3)Publication Date: 2020-03-31
Authors : Mohammed M. Ali Al-Shamiri; A. Elrokh; Yasser El –Mashtawye; S. Euat Tallah;
Page : 331-341
Keywords : Cartesian Product; Cordial; Cycle; Graph; Labeling; Path;
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.
Other Latest Articles
- STRATEGY FOR DEVELOPMENT OF TOURIST VILLAGE IN BALI ISLAND
- BIOSTRATIGRAPHIC CORRELATION OF PALEOZOIC ROCKS IN NORTHERN AND WESTREN IRAQ
- ON SOME NON-DERANGED PERMUTATION: A NEW METHOD OF CONSTRUCTION
- Innovative Approach to Detect Intruder in Coconut and Areca Nut Farmlands
- Some Statistical Characteristics of the Trihalomethanes Content in Drinking Water of Infiltration Water Intak
Last modified: 2020-07-18 20:31:27