Results 21 to 30 of about 302 (172)
3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph
Journal of Mathematics, 2021 Let G be a simple graph with vertex set VG and edge set EG. An edge labeling δ:EG⟶0,1,…,p−1, where p is an integer, 1≤p≤EG, induces a vertex labeling δ∗:VH⟶0,1,…,p−1 defined by δ∗v=δe1δe2⋅δenmodp, where e1,e2,…,en are edges incident to v.
Rizwan Ullah +4 more
doaj +1 more source
Circulation in Computer Science, 2017 We show that some special families of graphs have prime cordial labeling. We prove that If G is not a prime cordial graph of order m then G∪K_(1,n)is a prime cordial graph if E(G)= n-1,n or n+1 , and we prove that S^' (K_(2,n)), Jelly fish graph , Jewel graph, the graph obtained by duplicating a vertex v_k in the rim of the helm H_nand the graph ...
M. A. Seoud +2 more
openaire +1 more source
The computational complexity of cordial and equitable labelling
Discrete Mathematics, 2000 For a graph \(G=(V,E)\), a labelling \(f: V \rightarrow \{0,1,\ldots, k-1\}\) is \(k\)-equitable, if for each \(0 \leq i < j \leq k-1\), we have \(|V_i|- |V_j|\in \{-1,0,1\}\) and \(|E_i|- |E_j|\in \{-1,0,1\}\), where \(V_i\) is the set of vertices with label \(i\), and \(E_i\) is the set of edges \(\{v,w\}\) with \(|f(v) - f(w)|= i\).
Cairnie, N., Edwards, K.
openaire +2 more sources
A totally magic cordial labeling of one-point union of n copies of a graph [PDF]
Opuscula Mathematica, 2014 A graph \(G\) is said to have a totally magic cordial (TMC) labeling with constant \(C\) if there exists a mapping \(f: V(G)\cup E(G)\rightarrow \left\{0,1\right\}\) such that \(f(a) + f(b) + f(ab) \equiv C(\mbox{mod 2})\) for all \(ab\in E(G)\) and ...
P. Jeyanthi, N. Angel Benseera
doaj +1 more source
Broader families of cordial graphs
Indonesian Journal of Combinatorics, 2021 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.
Christian Barrientos, Sarah Minion
doaj +1 more source
Graceful and Cordial Labeling Of Subdivision Of Graphs
Electronic Notes in Discrete Mathematics, 2016 Abstract An edge uv is said to be subdivided if the edge uv is replaced by the path P : u w v , where w is the new vertex. A graph obtained by subdividing each edge of a graph G is called subdivision of the graph G, and is denoted by S ( G ) .
K. Sankar, G. Sethuraman 0001
openaire +1 more source
A comprehensive survey on prime cordial and divisor cordial labeling of graphs
Journal of Physics: Conference Series, 2020 AbstractThis article presents a short and concise survey on prime cordial and divisor cordial labeling of graphs. A prime cordial labeling of a graphG(V,E) is a bijective functionf:V(G) → {1,2,…,|V|} such that if each edgexyis assigned the label 1 ifgcd(f(x),f(y)) = 1 and 0 ifgcd(f(x),f(y)) > 1, then the number of edges labeled with 0 and the number
A. Parthiban, Vishally Sharma
openaire +1 more source
3-Difference cordial labeling of some path related graphs
Indonesian Journal of Combinatorics, 2018 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
R Ponraj, M Maria Adaickalam, R Kala
doaj +1 more source
Further results on Parity Combination Cordial Labeling [PDF]
Journal of the Egyptian Mathematical Society, 2020 AbstractLet G be a (p, q)-graph. Let f be an injective mapping from V(G) to {1, 2, …, p}. For each edge xy, assign the label $$ \left(\genfrac{}{}{0pt}{}{x}{y}\right) $$xy or $$ \left(\genfrac{}{}{0pt}{}{y}{x}\right) $$yx according as x > y or y > x. Call f a parity combination cordial labeling if |ef(0) − ef(1)| ≤ 1, where ef(0) and ef(1) denote
M. A. Seoud, Mohamed Aboshady
openaire +2 more sources
Further Results on Bijective Product k-Cordial Labeling
MathematicsA bijective product k-cordial labeling f of a graph G with vertex set V and edge set E is a bijection from V to {1,2,…,|V|} such that the induced edge labeling f×:E(G)→Zk={i|0≤i≤k−1} defined as f×(uv)≡f(u)f(v)(modk) for every edge uv∈E satisfies the ...
Sabah A. Bashammakh +4 more
doaj +1 more source