Results 61 to 70 of about 1,379,256 (326)
New classes of graphs with edge δ− graceful labeling
AIMS Mathematics, 2022 Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems).
Mohamed R. Zeen El Deen, Ghada Elmahdy
doaj +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
R. Mohammad Abbas, T. Hameed Hassan
openaire +3 more sources
Generating graceful unicyclic graphs from a given forest
AKCE International Journal of Graphs and Combinatorics, 2020 Acharya (1982) proved that every connected graph can be embedded in a graceful graph. The generalization of this result that, any set of graphs can be packed into a graceful graph was proved by Sethuraman and Elumalai (2005). Recently, Sethuraman et al. (
G. Sethuraman, V. Murugan
doaj +1 more source
Additively graceful signed graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Let [Formula: see text] be a signed graph of order p and size q. Let [Formula: see text] and [Formula: see text] Let [Formula: see text] be an injective function and let [Graphic: see text]gf(uv)={|f(u)−f(v)| if uv∈E+f(u)+f(v) if uv∈E−The function f is ...
Jessica Pereira +2 more
doaj +1 more source
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
Construction of an -labeled tree from a given set of -labeled trees
AKCE International Journal of Graphs and Combinatorics, 2017 Inspired by the method of Koh et al. (1979) of combining known graceful trees to construct bigger graceful trees, a new class of graceful trees is constructed from a set of known graceful trees, in a specific way.
G. Sethuraman, P. Ragukumar
doaj +1 more source
Graceful And Graceful Labeling Of Graphs
, 2018 {"references": ["1.\tJ. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2.\tI. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3.\tGutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4.\tI.
M. Soundharya, R. Balakumar
openaire +2 more sources
Graceful labeling of hexagonal snakes [PDF]
AIP Conference Proceedings, 2019 Consider a graph G with p number of vertices and q number of edges. If the edges of the graph are labeled by subtracting the corresponding vertex label of the respective edges following the condition that the labels of the vertices and edges are distinct is known as Graceful labeling of a graph.
Tamilselvi Loganathan +2 more
openaire +2 more sources
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Fibonacci and Super Fibonacci Graceful Labeling of Some Graphs [PDF]
, 2011 : In the present work we discuss the existence and non-existence of Fibonacci and super Fibonacci graceful labeling for certain graphs. We also show that the graph obtained by switching a vertex in cycle Cn, (where n >= 6 ) is not super Fibonacci ...
Vaidya, S. K.
core +2 more sources