Results 1 to 10 of about 836 (298)

Radio Graceful Labelling of Graphs

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

m-Bonacci graceful labeling [PDF]

open access: yesAKCE 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   +2 more sources

Graceful Labeling of Hypertrees

open access: diamondJournal of Mathematics Research, 2021
Graph labeling is considered as one of the most interesting areas in graph theory. A labeling for a simple graph G (numbering or valuation), is an association of non -negative integers to vertices of G  (vertex labeling) or to edges of G  (edge labeling) or both of them.
H. El-Zohny   +3 more
openalex   +3 more sources

Prime Graceful Labeling

open access: diamondInternational Journal of Engineering & Technology, 2018
A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection   from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that  gcd ( ( ),  ( )=1 and the induced injective function   from the edges of G to {1, 2, ..., k − 1} defined by  ( ) = |  ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openalex   +3 more sources

On edge-graceful labeling and deficiency for regular graphs

open access: goldAKCE 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

Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling [PDF]

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

Graceful Labeling of Posets [PDF]

open access: diamondInternational 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, Deepak S. Shelke
openalex   +2 more sources

GRACEFUL LABELING OF HANGING THETA GRAPHS [PDF]

open access: bronzeInternational Journal of Pure and Apllied Mathematics, 2013
Summary: In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling.
T. N. Janakiraman, G. Sathiamoorthy
openalex   +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

Edge odd graceful labeling of some path and cycle related graphs

open access: yesAKCE 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

Home - About - Disclaimer - Privacy