Results 101 to 110 of about 209,693 (137)

On $k$-Super Graceful Labeling of Graphs

, 2018
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$-super graceful labeling of $G$.
Lau, Gee-Choon, Shiu, Wai-Chee, Ng, Ho-Kuen   +2 more
openaire   +3 more sources

Graceful and residually graceful graphs

, 2006
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to certain conditions. The first type of labeling was introduced by Rosa as early as 1967. It is called -valuation and, more popularly known as graceful labeling
Tan, Michele Go
core  

Graceful Labelings of Pendant Graphs [PDF]

, 2017
In 1967, Alexander Rosa introduced a new type of graph labeling called a graceful labeling. This paper will provide some background on graceful labelings and their relation to certain types of graphs called pendant graphs.
Graf, Alessandra
core   +1 more source

Random Generation Topology Coding Technique in Asymmetric Topology Encryption

Mathematics
The security of traditional public key cryptography algorithms depends on the difficulty of the underlying mathematical problems. Asymmetric topological encryption is a graph-dependent encryption algorithm produced to resist attacks by quantum computers ...
Jing Su, Bing Yao
doaj   +1 more source

Planar and non-planar wheel-related networks possess edge -graceful labeling

Mathematics Open
For an integer [Formula: see text], consider a collection of numbers [Formula: see text] and a network [Formula: see text] with [Formula: see text] and [Formula: see text].
Mohamed R. Zeen El Deen, I. Hanafy, S. Shehda, N. Omar   +3 more
doaj   +1 more source

Discussion on some interesting topics in Graph Theory [PDF]

, 2011
Not ...
Vihol, Prakash L.
core  

Study of Some Interesting Topics in the Theory of Graphs [PDF]

, 2010
Not ...
Dani, Nilish A.
core  

Super Fibonacci Graceful Labeling of Some Special Class of Graphs

, 2014
: A Smarandache-Fibonacci Triple is a sequence S(n), n ≥ 0 such that S(n) = S(n − 1) + S(n − 2), where S(n) is the Smarandache function for integers n ≥ 0. Certainly, it is a generalization of Fibonacci sequence. A Fibonacci graceful labeling and a super
S. Navaneethakrishnan, R. Sridevi, K. Nagarajan   +2 more
core  

Common Techniques in Graceful Tree Labeling with a New Computational Approach [PDF]

, 2016
The graceful tree conjecture was first introduced over 50 years ago, and to this day it remains largely unresolved. Ideas for how to label arbitrary trees have been sparse, and so most work in this area focuses on demonstrating that particular classes of
Guyer, Michael
core  

Graceful labelings of the generalized Petersen graphs

Communications in Combinatorics and Optimization, 2017
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is an‎ ‎injection $f‎: ‎V(G) \rightarrow \{0,1,\ldots,m\}$ such that the resulting edge labels‎ ‎obtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct‎.
Zehui , Fei , Zepeng
doaj