Results 71 to 80 of about 4,425 (218)
Graceful Labeling of Spider Graphs With at Most Five Legs
A graceful labeling of a graph G with q edges is an injection f from the vertices of G to the set 0,1,⋯,q such that, when each edge uv is assigned the label fu−fv, the resulting edge labels are distinct.
A. Panpa, S. Imnang, T. Wasuanankul
doaj +1 more source
On Integer Additive Set-Indexers of Graphs [PDF]
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
On cordial labeling of hypertrees
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
SciLitMiner: An Intelligent System for Scientific Literature Mining and Knowledge Discovery
SciLitMiner is an intelligent system that federately ingests scientific literature, filters it using advanced information retrieval methods, and applies retrieval‐augmented generation tailored to scientific domains. Demonstrated on creep deformation in γ‐TiAl alloys, SciLitMiner provides a controlled workflow for systematic knowledge discovery and ...
Vipul Gupta +3 more
wiley +1 more source
Ultrasound contrast agents, including microbubbles and nanobubbles, transform imaging and targeted therapy through precise engineering of size, shell composition, and surface properties. This review explores how these innovations enable tissue‐specific delivery, enhance therapeutic efficacy, and extend applications from vascular imaging to tumor ...
Ashkan Seza +2 more
wiley +1 more source
The connection between the magical coloring of trees
Let $ f $ be a set-ordered edge-magic labeling of a graph $ G $ from $ V(G) $ and $ E(G) $ to $ [0, p-1] $ and $ [1, p-1] $, respectively; it also satisfies the following conditions: $ |f(V(G))| = p $, $ \max f(X) < \min f(Y) $, and $ f(x)+f(y)+f(xy) =
Jing Su , Qiyue Zhang , Bing Yao
doaj +1 more source
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
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
On alpha labeling of tensor product of paths and cycles. [PDF]
L U, G R.
europepmc +1 more source
A structural approach to the graceful coloring of a subclass of trees. [PDF]
D L, S DY.
europepmc +1 more source
Edge even and edge odd graceful labelings of Paley Graphs
T. Kamaraj, J Thangakani
openalex +1 more source

