Quotient-3 Cordial Labelling For Cycle Related Graphs
Journal: International Journal of Innovative Research in Applied Sciences and Engineering (Vol.1, No. 3)Publication Date: 2017-09-07
Authors : Dr.P.Sumathi; A.Mahalakshmi; A.Rathi;
Page : 73-79
Keywords : cycle; joint sum; subdivision; quotient-3 cordial graph.;
Abstract
: Let G be a graph of order p and size q. Let f: V (G) Z4 – {0} be a function. For each E (G) define f*: E (G) Z3 by f*(uv) = (mod 3) where f (u) f (v). If the number of vertices having label i and the number of vertices having label j differ by maximum 1, the number of edges having label k and the number of edges having label l differ by maximum 1 then the function f is said to be quotient-3 cordial labeling of G. 1 ≤ i, j ≤ 3, i and 0 ≤ k, l ≤ 2, k l. Here we proved that Cn and some cycle related graphs like [Cn ; C3], n=3,6,9,…, (P2 mk1) + N2 , S (Cn ; S2), joint sum of Cn and two cycles Cn having a common vertex is quotient-3 cordia
Other Latest Articles
- DATA MINING AND ITS EFFICACY IN KNOWLEDGE MANAGEMENT WITH RESPECT TO HRIS APPLICATION
- AMBUSH MARKETING: THE UNOFFICIAL FREE RIDING
- Unique Enresdowed Graphs
- EFFECT OF COMMUNITY BASED AREA-WIDE FRUIT FLY SUPPRESSION ON BACTROCERA DORSALIS POPULATION IN ORANGE ORCHARDS IN MUHEZA DISTRICT TANZANIA
- A STUDY ON NEW HIRING STRATEGIES TO MANAGE TALENT CRISIS AT ENTRY LEVEL FROM THE PERSPECTIVE OF RECRUITERS AND FRESH GRADUATE ENGINEER JOB SEEKERS
Last modified: 2017-08-28 19:11:31