Results 41 to 50 of about 5,140 (295)
Some New Results on Strong Integer Additive Set-Indexers of Graphs
, 2014 Let $\mathbb{N}_0$ be the set of all non-negative integers. An integer additive set-indexer of a graph $G$ is an injective function $f:V(G)\to 2^{\mathbb{N}_0}$ such that the induced function $g_f:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $f^+(uv ...
Germina, K. A., Sudev, N. K.
core +2 more sources
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
An evaluation on the gracefulness and colouring of graphs [PDF]
, 2017 In this thesis we shall introduce two interesting topics from graph theory and begin to explore what happens when we combine these together. We will be focusing on an area known as graph colouring and assessing it alongside a very unique set of graphs ...
Dhami, Kymrun K.
core
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 Integer Additive Set-Indexers of Graphs [PDF]
, 2014 A set-indexer of a graph $G$ is an injective set-valued function $f:V(G) \rightarrow2^{X}$ such that the function $f^{\oplus}:E(G)\rightarrow2^{X}-\{\emptyset\}$ defined by $f^{\oplus}(uv) = f(u){\oplus} f(v)$ for every $uv{\in} E(G)$ is also injective ...
Germina, K. A., Sudev, N. K.
core +2 more sources
A Study on Integer Additive Set-Valuations of Signed Graphs [PDF]
, 2015 Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to
Germina, K. A., Sudev, N. K.
core +4 more sources
Solid Harmonic Wavelet Bispectrum for Image Analysis
Advanced Science, EarlyView.The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown +3 more
wiley +1 more source
On cordial labeling of hypertrees
, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Tuczyński, Michał +2 more
core +1 more source