Results 1 to 10 of about 6,714 (280)
m-Bonacci graceful labeling [PDF]
AKCE 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. We show that complete graphs, complete bipartite graphs, gear graphs, triangular grid graphs, and wheel graphs ...
Kalpana Mahalingam +1 more
openaire +2 more sources
Radio Graceful Labelling of Graphs
Theory and Applications of Graphs, 2020 Summary: Radio labelling problem of graphs have their roots in communication problem known as Channel Assignment Problem. For a simple connected graph \(G=(V(G),E(G))\), a radio labeling is a mapping \(f:V(G)\to \{0,1,2,\dots\}\) such that \(|f(u)-f(v)|\ge\text{diam}(G)+1-d(u,v)\) for each pair of distinct vertices \(u,v\in V(G)\), where \(\text{diam ...
Saha, Laxman, Basunia, Alamgir Rahaman
openaire +6 more sources
Lucas Graceful Labeling for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A. +2 more
core +3 more sources
, 2012 In this paper we introduce a generalization of the well known concept of a graceful labeling. Given a graph G with e=dm edges, we call d-graceful labeling of G an injective function from V(G) to the set {0,1,2,..., d(m+1)-1} such that {|f(x)-f(y)| | [x,y]
Pasotti, A.
core +3 more sources
Graceful Labeling of Hypertrees
Journal 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
openaire +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. +2 more
core +1 more source
Super Fibonacci Graceful Labeling of Some Special Class of Graphs [PDF]
, 2011 A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in ...
Nagarajan, K. +2 more
core +1 more source
International 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
openaire +2 more sources
Improved Bounds for Relaxed Graceful Trees [PDF]
, 2016 We introduce left and right-layered trees as trees with a specific representation and define the excess of a tree. Applying these ideas, we show a range-relaxed graceful labeling which improves on the upper bound for maximum vertex label given by Van ...
Barrientos, Christian, Krop, Elliot
core +1 more source
Relaxed Graceful Labellings of Trees [PDF]
The 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.
openaire +2 more sources