Results 11 to 20 of about 219,967 (286)

Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling

Journal of Mathematics, 2021
Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj   +2 more sources

Further results on super graceful labeling of graphs

AKCE International Journal of Graphs and Combinatorics, 2016
Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G.
Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng
doaj   +2 more sources

Graceful labeling on torch graph

Indonesian Journal of Combinatorics, 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
doaj   +2 more sources

On edge-graceful labeling and deficiency for regular graphs

AKCE International Journal of Graphs and Combinatorics, 2018
An edge-graceful labeling of a finite simple graph with vertices and edges is a bijection from the set of edges to the set of integers such that the vertex sums are pairwise distinct modulo , where the vertex sum at a vertex is the sum of labels of all ...
Tao-Ming Wang, Guang-Hui Zhang
doaj   +3 more sources

Applications of mathematical programming in graceful labeling of graphs [PDF]

Journal of Applied Mathematics, 2004
Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper,
Kourosh Eshghi, Parham Azimi
doaj   +2 more sources

Lucas Graceful Labeling For Some Graphs [PDF]

, 2011
By a graph, we mean a finite undirected graph without loops or multiple edges.
Perumal, M. A., Navaneethakrishnan, S., Nagarajan, A.   +2 more
openaire   +4 more sources

Radio Graceful Hamming Graphs [PDF]

Discussiones Mathematicae Graph Theory, 2016
For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G).
Niedzialomski Amanda
doaj   +2 more sources

Octagonal prime graceful labeling [PDF]

Ratio Mathematica
Let G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all ...
V Akshaya
doaj   +2 more sources

Vertex Graceful Labeling-Some Path Related Graphs [PDF]

, 2013
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P., Renuka, J., Selvaraju, P.   +2 more
core   +1 more source

Matching-Type Image-Labelings of Trees

Mathematics, 2021
A variety of labelings on trees have emerged in order to attack the Graceful Tree Conjecture, but lack showing the connections between two labelings. In this paper, we propose two new labelings: vertex image-labeling and edge image-labeling, and combine ...
Jing Su, Hongyu Wang, Bing Yao
doaj   +1 more source