Results 31 to 40 of about 1,000,377 (259)
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 +2 more sources
IEEE transactions on multimedia, 2021 Point cloud is an emerging data format useful for various applications such has holographic display, autonomous vehicle, and augmented reality. Conventionally, communications of point cloud data have relied on digital compression and digital modulation ...
T. Fujihashi +3 more
semanticscholar +1 more source
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
doaj +1 more source
A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm
WSEAS Transactions on Mathematics, 2021 A method for relaxed graceful labeling of P2n graphs is presented together with an algorithm designed for labeling these graphs. Graceful labeling is achieved by relaxing the range to 2m and perform the labeling using an algorithm with quadratic ...
F. Taweel +2 more
semanticscholar +1 more source
On graceful chromatic number of comb product of ladder graph
, 2021 Let G be a connected and simple graph. Proper vertex colouring c : V(G) — {1, 2, 3,…, k} where k → 2 that induces a proper edge colouring c’ : E(G) — {1, 2, 3,…, k — 1} define by c’(uv)=|c(u) — c(v)|, where uv in E(G) is called graceful k— colouring ...
S. Khoirunnisa +4 more
semanticscholar +1 more source
Graceful labeling on a multiple-fan graph with pendants
, 2021 An injective function f from the set of vertices in a graph G to a set {0,1,…,n} is called graceful labeling if the function f induced the edge function f* from the set of edges of G to a set of positive integers {1,2,…,n} with f*(xy) = |f(x) − f(y)| for
A. Akerina, K. Sugeng
semanticscholar +1 more source
Discrete Mathematics, 1991 Using the concept of a Skolem sequence \(\{u_ 1,\ldots,u_{2n}\}\) of \(2n\geq 2\) terms, \(u_ i\in\mathbb{N}\), the authors introduce a new kind of vertex labeling of a graph \(G=(V,E)\) arising from the well-known concept of the graceful labeling of \(G\) by substituting the graceful (injective) mapping \(f:V\to\{0,1,\ldots,| E|\}\) by \(f:V\to\{1,2 ...
Lee, S.M., Shee, S.C.
openaire +2 more sources
Dividing Graceful Labeling of Certain Tree Graphs
Tikrit Journal of Pure Science, 2020 A tree is a connected acyclic graph on n vertices and m edges. graceful labeling of a tree defined as a simple undirected graph G(V,E) with order n and size m, if there exist an injective mapping that induces a bijective mapping defined by for ...
Abdullah Zahraa O +2 more
doaj +1 more source
Skolem graceful labeling of Lobster graph Ln(2,r)
, 2021 Let G be a finite simple graph with vertex set V(G) and edge set (G). A skolem graceful labeling of G is an injective function f: V(G) → {1, 2, 3, …, |V(G)|} such that the induced labeling f’: E(G) → {1, 2, 3, …, |E(G) |} defined by f’(uv) = |f(u) - f(v)|
Dwi Aruma Urnika, Purwanto
semanticscholar +1 more source
The Gracefulness of the Join of Graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract We give a brief survey on the gracefulness of the join of two graphs, and present results on the gracefulness of the join of a cycle and a broken path.
Khee Meng Koh, L. Y. Phoon, Kian Wee Soh
openaire +1 more source