Results 21 to 30 of about 209,693 (137)

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

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

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

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

Computer search for graceful labeling: a survey

Electronic Journal of Graph Theory and Applications, 2022
This paper surveys the main computer search results for finding graceful labeling of trees. The paper is devoted to the memory of Mirka Miller, who made an outstanding contribution to the area of graph labeling.
Ljiljana Brankovic, Michael J. Reynolds
doaj   +3 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

Edge Even Graceful Labeling of Polar Grid Graphs

Symmetry, 2019
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph G with p vertices and q edges is a bijection f from the edges of the graph to the set { 2 , 4 ...
S N Daoud
exaly   +2 more sources

Edge odd graceful labeling of some path and cycle related graphs

AKCE International Journal of Graphs and Combinatorics, 2017
Solairaju and Chithra introduced a new type of labeling of a graph with vertices and edges called an edge odd graceful labeling if there is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges ...
S.N. Daoud
exaly   +2 more sources

Edge δ− Graceful Labeling for Some Cyclic-Related Graphs

Advances in Mathematical Physics, 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
doaj   +2 more sources

ON k-GRACEFUL LABELING OF SOME GRAPHS

Journal of Applied Mathematics & Informatics, 2016
Summary: In this paper, it has been shown that the hairy cycle \(C_{n}\odot rK_{1},\) \(n\equiv 3\pmod 4\), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle \(C_{n}\odot 1K_{1}\), \(n\equiv 0\pmod 4\), double graph of path \(P_{n}\) and double graph of comb \(P_{n}\odot 1K_{1}\) are \(k\)-graceful.
Pradhan, P., Kumar, Kamesh
exaly   +4 more sources