Results 11 to 20 of about 6,739 (277)
Graceful and Cordial Labeling Of Subdivision Of Graphs
Electronic Notes in Discrete Mathematics, 2016 Abstract An edge uv is said to be subdivided if the edge uv is replaced by the path P : u w v , where w is the new vertex. A graph obtained by subdividing each edge of a graph G is called subdivision of the graph G, and is denoted by S ( G ) .
K. Sankar, G. Sethuraman 0001
exaly +2 more sources
Jambura 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 +1 more source
Polygonal Graceful Labeling of Some Simple Graphs
Ratio Mathematica, 2022 Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A polygonal graceful labeling of a graph is an injective function , where is a set of all non-negative integers that induces a bijection , where is the ...
A Rama Lakshmi, M P Syed Ali Nisaya
doaj +1 more source
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Ratio Mathematica, 2022 Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling
Journal 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 +1 more source
Matching-Type Image-Labelings of Trees
Mathematics, 2021 A variety of labelings on trees have emerged in order to attack the Graceful Tree Conjecture, but lack showing the connections between two labelings. In this paper, we propose two new labelings: vertex image-labeling and edge image-labeling, and combine ...
Jing Su, Hongyu Wang, Bing Yao
doaj +1 more source
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
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
Tight super-edge-graceful labelings of trees and their applications
AKCE International Journal of Graphs and Combinatorics, 2015 The concept of graceful labeling of graphs has been extensively studied. In 1994, Mitchem and Simoson introduced a stronger concept called super-edge-graceful labeling for some classes of graphs.
Alex Collins, Colton Magnant, Hua Wang
doaj +1 more source
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