Results 11 to 20 of about 1,379,256 (326)

Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It’s Application in Cryptography

open access: goldJambura 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   +5 more sources

m-Bonacci graceful labeling [PDF]

open access: goldAKCE 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   +5 more sources

Radio Graceful Labelling of Graphs [PDF]

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

The Edge Odd Graceful Labeling of Water Wheel Graphs

open access: goldAxioms
A graph, G=(V,E), is edge odd graceful if it possesses edge odd graceful labeling. This labeling is defined as a bijection g:E(G)→{1,3,…,2m−1}, from which an injective transformation is derived, g*:V(G)→{1,2,3,…,2m−1}, from the rule that the image of u∈V(
Mohammed Aljohani, Salama Nagy Daoud
doaj   +3 more sources

Graceful labeling of posets

open access: bronzeInternational 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.
A. N. Bhavale, Dheeraj Shelke
semanticscholar   +4 more sources

Super Fibonacci Graceful Labeling [PDF]

open access: greenviXra, 2011
A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in ...
R. Sridevi   +2 more
core   +8 more sources

Applications of mathematical programming in graceful labeling of graphs [PDF]

open access: goldJournal of Applied Mathematics, 2004
Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper,
Kourosh Eshghi, Parham Azimi
doaj   +6 more sources

Polygonal Graceful Labeling of Some Simple Graphs [PDF]

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

A Noval Approach on Picture Fuzzy Graceful Labeling in Fluid flows

open access: bronzeTuijin Jishu/Journal of Propulsion Technology, 2023
Graph labeling is one of the best network models in the study of fluid dynamics in the flow of particles. But the said labeling is not provided the better results to represent in any of network model having neutral membership degree in case of ambiguity.
N. Sujatha
openalex   +3 more sources

Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling

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   +2 more sources

Home - About - Disclaimer - Privacy