Results 71 to 80 of about 6,739 (277)
Abstract The concept of graph labeling was introduced in the mid-1960s by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the `adjunct' operation of two lattices with respect to an adjunct ...
Ashok Bhavale, Dr. DEEPAK SHELKE*
openaire +2 more sources
Pelabelan Graceful Satu Modulo Pada Beberapa Graf Eule [PDF]
. A graph with edges is said to be one modulo graceful graph () if there is a injective function from vertex set of graph to in such a way that induces a function from edge set of graph to defined as is bijective.
Isa, I. (Isa), Ratnasari, L. (Lucia)
core
Ordered graceful labellings of the 2-star
The authors investigate ordered graceful labellings of 2-stars. They give a lower bound on the number of non-equivalent ordered graceful labellings by constructing an exponential number of such labellings. This shows that a conjecture of Cahit is false.
Richard J. Nowakowski +1 more
openaire +2 more sources
Multimodal Wearable Biosensing Meets Multidomain AI: A Pathway to Decentralized Healthcare
Multimodal biosensing meets multidomain AI. Wearable biosensors capture complementary biochemical and physiological signals, while cross‐device, population‐aware learning aligns noisy, heterogeneous streams. This Review distills key sensing modalities, fusion and calibration strategies, and privacy‐preserving deployment pathways that transform ...
Chenshu Liu +10 more
wiley +1 more source
Alpha graphs with different pendent paths
Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful labeling, the α-labeling, is in the center of the research field of graph labelings, the existence of ...
Christian Barrientos
doaj +1 more source
Lobsters with an almost perfect matching are graceful [PDF]
Let $T$ be a lobster with a matching that covers all but one vertex.
Krop, Elliot
core
Graceful labelling of the union of paths and cycles
The authors show that \(C_5\cup P_n\) is graceful and \(C_s\cup P_n\) is graceful for every \(s\geq 5\) when \(n\geq (s+ 5)/2\). This result is another step towards settling the conjecture that \(C_s\cup P_n\) is graceful whenever \(n+ s\geq 7\).
Sheshayya A. Choudum +1 more
openaire +2 more sources
Smart Nanotechnologies for Multimodal Neuromodulation and Brain Interfacing
Recent advances in smart nanotechnologies are expanding the toolbox for brain interfacing, from wireless neuromodulation and high‐resolution sensing to targeted delivery within the central nervous system. By combining responsive nanomaterials with bioinspired design, these platforms enable multimodal interactions with neurons and glia, while also ...
Tommaso Curiale +6 more
wiley +1 more source
Radio Labelings of Lexicographic Product of Some Graphs
Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different ...
Muhammad Shahbaz Aasi +3 more
doaj +1 more source
Topological Integer Additive Set-Sequential Graphs
Let $\mathbb{N}_0$ denote the set of all non-negative integers and $X$ be any non-empty subset of $\mathbb{N}_0$. Denote the power set of $X$ by $\mathcal{P}(X)$. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $
Augustine, Germina +2 more
core +2 more sources

