3-Difference cordial labeling of some path related graphs release_rjglbj5fx5cetkvj5vo2f7ixwq

by R Ponraj, M Maria Adaickalam, R Kala

Published in Indonesian Journal of Combinatorics by UPT Penerbitan Universitas Jember.

2018  

Abstract

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤ p. For each edge uv, assign the label |f(u) − f(v)|. f is called k-difference cordial labeling of G if |vf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x, ef (1) and ef (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate 3-difference cordial labeling behavior of triangular snake, alternate triangular snake, alternate quadrilateral snake, irregular triangular snake, irregular quadrilateral snake, double triangular snake, double quadrilateral snake, double alternate triangular snake, and double alternate quadrilateral snake.
In application/xml+jats format

Archived Files and Locations

application/pdf  707.7 kB
file_4uajr7tol5hvngxhwpjl5pcfiq
jac.ut.ac.ir (web)
web.archive.org (webarchive)
application/pdf  235.0 kB
file_xiyeagkzgfccvm2dch7znmzg7e
web.archive.org (webarchive)
www.ijc.or.id (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2018-06-12
Journal Metadata
Open Access Publication
In DOAJ
Not in Keepers Registry
ISSN-L:  2541-2205
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 385b7cf3-c800-4c5d-86d3-5bb4bf25b2f6
API URL: JSON