ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Education
Computing
Social Sciences
Research
Computing
Biology
Languages
Literature
Technology
all records (64)

Languages
English
Spanish
Portuguese

Countries
Indonesia
Brazil
USA
Chile
Spain
Italy
Germany
Colombia
Australia
Romania
all records (55)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
1.155  Articles
1 of 117 pages  |  10  records  |  more records»
A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) ? {1, 2, ..., |V (G)|} such that an edge uv assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise. Further the number of edges labeled with 0 and the the numb... see more

A mapping f : V (G) ? {0, 1, 2} is called 3-product cordial labeling if |vf(i) - vf(j)| = 1 and |ef(i) - ef(j)| = 1 for any i, j ? {0, 1, 2}, where vf(i) denotes the number of vertices labeled with i, ef(i) denotes the number of edges xy with f(x)f(y) = i... see more

Let G be a (p,q) graph. A mapping f : V (G) ? {0, 1, 2} is called 3-product cordial labeling if |v????(i) - v???? (j)| = 1 and |e???? (i) - e???? (j)| = 1 for any i, j ? {0, 1, 2},where v???? (i) denotes the number of vertices labeled with i, e???? (i) de... see more

Given a bijection ? : V(G) ? {1,2, …,|V(G)|}, we associate 2 integers S = ?(u)+?(v) and D = |?(u)-?(v)| with every edge uv in E(G). The labeling ? induces an edge labeling ?' : E(G) ? {0,1} such that for any edge uv in E(G), ? '(uv)=1 if gcd(S,D)=1, and ?... see more

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) den... see more

A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1. In this pa... see more

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 wher... see more

A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, . . . , |V(G)|} such that an edge uv is assigned the label 1 if 2 divides f (u) + f (v) and 0 otherwise; and the number of edges labeled with 0 and the nu... see more

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V(G) U E(G) ? {0,1} such that f (a) + f (b) + f (ab) = C (mod 2) for all ab ? E(G) and |nf (0) — nf (1)| = 1, where nf(i) (i = 0, ... see more

1 of 117 pages  |  10  records  |  more records»