Results 51 to 60 of about 6,739 (277)
Pelabelan Graceful pada Digraf Lintasan dan Digraf Bipartit Lengkap [PDF]
, 2008 A graceful labeling of digraph is a one to one function------ --------------------------- such that each arc in D is labeled with , the resulting arc labels are distinct.
Fatekurohman, M. (M) +2 more
core
International Journal of Engineering & Technology, 2018 A graph G with m vertices and n edges, is said to be prime graceful labeling, if there is an injection from the vertices of G to {1, 2, ..., k} where k = min {2m, 2n} such that gcd ( ( ), ( )=1 and the induced injective function from the edges of G to {1, 2, ..., k − 1} defined by ( ) = | ( ) − ( ) | , the resulting edge labels are distinct. In
T. Hameed Hassan, R. Mohammad Abbas
openaire +2 more sources
A Central Somatic Transmission Mediates Proprioceptive Facilitation of Muscle Pain
Advanced Science, EarlyView.Zhang et al. uncover a novel central mechanism for persistent muscle pain, in which TRPA1 sensitization in MeV proprioceptive neurons enhances somatic secretion. This, in turn, disinhibits descending pain control from neighboring noradrenergic locus coeruleus neurons via local GABAergic circuits, thereby promoting inflammatory muscle pain.
Xiaoyu Zhang +15 more
wiley +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
GRACEFUL LABELING OF HANGING THETA GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2013 Summary: In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling.
Janakiraman, T. N., Sathiamoorthy, G.
openaire +1 more source
Linearizing and Forecasting: A Reservoir Computing Route to Digital Twins of the Brain
Advanced Science, EarlyView.A new approach uses simple neural networks to create digital twins of brain activity, capturing how different patterns unfold over time. The method generates and recovers key dynamics even from noisy data. When applied to fMRI, it predicts brain signals and reveals distinctive activity patterns across regions and individuals, opening possibilities for ...
Gabriele Di Antonio +3 more
wiley +1 more source
On Graceful Spider Graphs with at Most Four Legs of Lengths Greater than One
Journal of Applied Mathematics, 2016 A graceful labeling of a tree T with n edges is a bijection f:V(T)→{0,1,2,…,n} such that {|f(u)-f(v)|:uv∈E(T)} equal to {1,2,…,n}. A spider graph is a tree with at most one vertex of degree greater than 2. We show that all spider graphs with at most four
A. Panpa, T. Poomsa-ard
doaj +1 more source
Edge δ− Graceful Labeling for Some Cyclic-Related Graphs
Advances in Mathematical Physics, 2020 In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj +1 more source
On graphs with α- and b-edge consecutive edge magic labelings
Indonesian Journal of Combinatorics, 2022 Among the most studied graph labelings we have the varieties called alpha and edge-magic. Even when their definitions seem completely different, these labelings are related.
Christian Barrientos
doaj +1 more source
A Study on Integer Additive Set-Graceful Graphs [PDF]
, 2015 A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\rightarrow \mathcal{P}(X)-\{\emptyset\}$ defined by $f^
Germina, K. A., Sudev, N. K.
core