Results 141 to 150 of about 302 (172)
On Signed Product Cordial Labeling ()
Applied Mathematics, 2011 A new concept of labeling called the signed product cordial labeling is introduced and investigated for path graph, cycle graphs, star-K1,n, Bistar-Bn,n, and Some general results on signed product cordial labeling are studied.
Jayapal Baskar Babujee +1 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On graceful and cordial labeling of shell graphs.
Ars Comb., 2011A graceful labeling, an \(\alpha \)-labeling (called here \(\Delta \)-labeling), and a cordial labeling of yet another special class of graphs are provided. Unfortunately, the paper contains many typographical, grammatical and stylistic errors.
G. Sethuraman 0001, K. Sankar
openaire +4 more sources
On V4-cordial Labeling of Graphs
British Journal of Mathematics & Computer Science, 2016In this Research article we prove the following results: 1. The crown graph Cn ⊙ K1 is V4-cordial for all n. 2. The armed crown ACn is V4-cordial for all n. 3. The pan graph C n is V4-cordial for all n. 4. The corona graph Cn ⊙ mK1 is V4-cordial for all n and m.
N Rathod, K Kanani
openaire +1 more source
ON SIGNED MAGIC CORDIAL LABELING
Advances and Applications in Discrete Mathematics, 2021Cynthia, V. Jude Annie, Padmavathy, E.
openaire +2 more sources
Zumkeller Cordial Labeling of Graphs
2015In this paper we introduce a new graph labeling called Zumkeller cordial labeling of a graph G = (V, E). It can be defined as an injective function f: V → N such that the induced function f* : E → {0, 1} defined by f*(xy) = f(x) f(y) is 1 if f(x) f(y) is a Zumkeller number and 0 otherwise with the condition \( \left| {{\text{e}}_{\text{f}}^{*} ( 0 )- {\
B. J. Murali +2 more
openaire +1 more source
Remainder Cordial Labeling of Graphs
2017In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$.
Ponraj, R., Annathurai, K., Kala, R.
openaire +1 more source
On Prime Cordial Labelings of Double Triangular Snake
2016 9th International Symposium on Computational Intelligence and Design (ISCID), 2016A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, …, |V|} such that if each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if gcd(f(u), f(v))> 1, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.
Yue Xi, Wingning Li
openaire +1 more source
On bijective product square k-cordial labeling
Discrete Mathematics, Algorithms and ApplicationsA bijective product square [Formula: see text]-cordial labeling of a graph [Formula: see text] with vertex set [Formula: see text] and edge set [Formula: see text] is a bijection [Formula: see text] from [Formula: see text] to [Formula: see text] such that the induced edge function [Formula: see text] from [Formula: see text] to [Formula: see text ...
R. Santrin Sabibha +3 more
openaire +3 more sources
On directed signed cordial labeling
Journal of Information and Optimization SciencesA measurable collection of dots and a collection of ordered pairings of different dots make up a directed graph, commonly known as a digraph 𝒟. Each (u,v) pair is denoted by uv where u is the arc’s beginning dot and v its terminal dot, is an arc. A digraph having V dots and A arcs is called D(V, A).
V. Jude Annie Cynthia, E. Padmavathy
openaire +1 more source
Cordial labeling in various graphs
AIP Conference Proceedings, 2023S. Suganya, V. J. Sudhakar
openaire +1 more source