Results 1 to 10 of about 680 (178)

m-Bonacci graceful labeling [PDF]

open access: goldAKCE International Journal of Graphs and Combinatorics, 2021
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam   +1 more
doaj   +4 more sources

Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It’s Application in Cryptography

open access: goldJambura Journal of Mathematics, 2021
Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for ...
Meliana Pasaribu   +2 more
doaj   +4 more sources

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

open access: goldJournal 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   +6 more sources

Graceful labellings of paths

open access: bronzeDiscrete Mathematics, 2007
AbstractIt is easily shown that every path has a graceful labelling, however, in this paper we show that given almost any path P with n vertices then for every vertex v∈V(P) and for every integer i∈{0,…,n-1} there is a graceful labelling of P such that v has label i. We show precisely when these labellings can also be α-labellings.
Rohan Cattell
openalex   +3 more sources

Graceful labeling of digraphs—a survey [PDF]

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v) − g(u)) (mod q + 1) If the arc values are all ...
Shivarajkumar, M. A. Sriraj, S. M. Hegde
doaj   +3 more sources

Radio Graceful Labelling of Graphs

open access: yesTheory and Applications of Graphs, 2020
Radio labelling problem of graphs have their roots in communication problem known as \emph{Channel Assignment Problem}. For a simple connected graph $G=(V(G), E(G))$, a radio labeling is a mapping $f \colon V(G)\rightarrow \{0,1,2,\ldots\}$ such that $|f(
Laxman Saha, Alamgir Basunia
doaj   +5 more sources

Edge even graceful labeling of some graphs [PDF]

open access: diamondJournal of the Egyptian Mathematical Society, 2019
Edge even graceful labeling is a new type of labeling since it was introduced in 2017 by Elsonbaty and Daoud (Ars Combinatoria 130:79–96, 2017). In this paper, we obtained an edge even graceful labeling for some path-related graphs like Y- tree, the ...
Mohamed R. Zeen El Deen
doaj   +2 more sources

Graceful labeling on torch graph

open access: yesIndonesian 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   +3 more sources

Graceful labeling of posets

open access: bronzeInternational Journal of Mathematics And Computer Research
The concept of graph labeling was introduced in mid-1960 by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the ‘adjunct’ operation of two lattices with respect to an adjunct pair of ...
A. N. Bhavale, Dheeraj Shelke
openalex   +2 more sources

Relaxed Graceful Labellings of Trees [PDF]

open access: bronzeThe Electronic Journal of Combinatorics, 2002
A graph $G$ on $m$ edges is considered graceful if there is a labelling $f$ of the vertices of $G$ with distinct integers in the set $\{0,1,\dots,m\}$ such that the induced edge labelling $g$ defined by $g(uv)=|f(u)-f(v)|$ is a bijection to $\{1,\dots,m\}$. We here consider some relaxations of these conditions as applied to tree labellings: 1.
Frank Van Bussel
openalex   +3 more sources

Home - About - Disclaimer - Privacy