Results 51 to 60 of about 1,270,493 (107)

AN ALGORITHM FOR ODD GRACEFULNESS OF THE TENSOR PRODUCT OF TWO LINE GRAPHS

, 2021
An odd graceful labeling of a graph G = (V E, ) is a function f V G E G : ( ) {0,1,2, . . .2 ( ) 1} → − such that | ( ) ( )| f u f v − is odd value less than or equal to 2 ( ) 1 E G − for any , ( ) u v V G ∈ .
M. Ibrahim Moussa
core   +1 more source

Nowhere-zero modular edge-graceful graphs [PDF]

, 2012
For a connected graph G of order n ≥ 3, let f: E(G) → ℤₙ be an edge labeling of G. The vertex labeling f': V(G) → ℤₙ induced by f is defined as $f'(u) = ∑_{v ∈ N(u)} f(uv)$, where the sum is computed in ℤₙ. If f' is one-to-one, then f is called a modular
Jones, Ryan, Zhang, Ping
core   +1 more source

On alpha labeling of tensor product of paths and cycles. [PDF]

Heliyon, 2023
L U, G R.
europepmc   +1 more source

Odd sum labeling of graphs obtained by duplicating any edge of some graphs [PDF]

, 2015
An injective function $f:V(G)\rightarrow \{0,1,2,\dots,q\}$ is an odd sum labeling if the induced edge labeling $f^*$ defined by $f^*(uv)=f(u)+f(v),$ for all $uv\in E(G),$ is bijective and $f^*(E(G))=\{1,3,5,\dots,2q-1\}.$ A graph is said to be an odd ...
S. Arockiaraj, Mahalakshmi, P. (P), P. Mahalakshmi, Arockiaraj, S. (S), P. Namasivayam, Namasivayam, P. (P)   +5 more
core   +1 more source

Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]

Entropy (Basel), 2023
Zhao M, Wang H, Yao B.
europepmc   +1 more source

D-Graceful Labeling of a Path

, 2016
[[abstract]]Let G be a undirected graph with a vertex set V and an edge set E. Given a nonnegative integer set D. A D-graceful labeling f of G is an injection f : V → D such that {|f(x) − f(y)| ¯¯ xy ∈ E} = {1, 2, 3, . . . , |E|}.
顏經和, Chi-Nan Chang, 張吉南, Jing-Ho Yan   +3 more
core  

Graceful labeling on torch graph

, 2018
Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}.
Jona Martinus Manulang, Kiki A. Sugeng
core   +1 more source

Janet Malcolm's Self‐Portrait

Critical Quarterly, Volume 68, Issue 2, Page 23-38, July 2026.
Jerome Boyd Maunsell
wiley   +1 more source

Edge δ− Graceful Labeling for Some Cyclic-Related Graphs

, 2020
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
core   +1 more source

Vertex graceful labeling of some classes of graphs

, 2018
A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V → {1, 2, 3, ··· p} such that the induced function f * : E → {0, 1, 2, ··· q - 1} defined by f * (uv) = (f(u) + f(v ...
Balaganesan, P., Santhakumaran, A. P.
core   +1 more source