Results 11 to 20 of about 836 (298)
Octagonal prime graceful labeling
Ratio MathematicaLet G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all ...
V Akshaya
doaj +2 more sources
Super Fibonacci Graceful Labeling
, 2011 Approaching topics such as Smarandache-Fibonacci triple, graceful labeling, Fibonacci graceful labeling, super Smarandache-Fibonacci graceful graph, super Fibonacci graceful graph.
R. Sridevi +2 more
openalex +3 more sources
Pell graceful labeling of graphs [PDF]
Malaya Journal of Matematik, 2019 D. Muthuramakrishnan, S. Sutha
openalex +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
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
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
Radio Number of Hamming Graphs of Diameter 3
Theory and Applications of Graphs, 2022 For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeling of $G$} if it satisfies $|f(u)-f(v)|\geq\diam(G)+1-d(u,v)$ for all distinct vertices $u,v\in V(G)$.
Jason DeVito +2 more
doaj +1 more source