Results 121 to 130 of about 219,967 (286)
A Class of ‘n’ Distant Graceful Trees [PDF]
, 2011 In this paper we show that a tree T with the following properties have graceful labeling. 1) T has a path H such that every pendant vertex of T has distance n (a fixed positive integer) from H.
Panda, Amaresh Chandra +2 more
core +1 more source
On the Number of α-Labeled Graphs
Discussiones Mathematicae Graph Theory, 2018 When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj +1 more source
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 +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
Two families of graceful cacti [PDF]
We present a graceful labeling for each member of a subfamily of quadrangular cacti whose underlying graph correspond to the subclass of rooted binary trees where every level has at most two vertices.
Barrientos, Christian
core +1 more source
Vertex graceful labeling of some classes of graphs
, 2018 A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V → {1, 2, 3, ··· p} such that the induced function f * : E → {0, 1, 2, ··· q - 1} defined by f * (uv) = (f(u) + f(v ...
Balaganesan, P., Santhakumaran, A. P.
core +1 more source
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
MathematicsThe 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
Super Fibonacci Graceful Labeling
, 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.
S. Navaneethakrishnan +2 more
core
The Anatomical Record, EarlyView.This review redefines the carotid bulb (CB) as a variable geometric dilation shaped by hemodynamics and the carotid sinus (CS) as a conserved neurohistological baroreceptor field. Distinguishing these entities clarifies a century of anatomical confusion and links geometry, neurohistology, and clinical interpretation within a unified framework ...
Răzvan Costin Tudose +2 more
wiley +1 more source
Distribution of doublecortin in the developing retina of birds: A comparative analysis
The Anatomical Record, EarlyView.Abstract The avian retina presents an elegant and highly accessible model for investigating the spatial and temporal dynamics of neurogenesis within the central nervous system. In recent years, the microtubule cytoskeleton has emerged not merely as a structural scaffold, but as a dynamic regulator of the transition of a morphologically homogeneous pool
Javier Francisco‐Morcillo +5 more
wiley +1 more source