Results 131 to 140 of about 1,379,256 (326)
In Situ Graph Reasoning and Knowledge Expansion Using Graph‐PRefLexOR
Advanced Intelligent Discovery, EarlyView.Graph‐PRefLexOR is a novel framework that enhances language models with in situ graph reasoning, symbolic abstraction, and recursive refinement. By integrating graph‐based representations into generative tasks, the approach enables interpretable, multistep reasoning.
Markus J. Buehler
wiley +1 more source
A structural approach to the graceful coloring of a subclass of trees. [PDF]
Heliyon, 2023 D L, S DY.
europepmc +1 more source
, 2013 A method to obtain all possible graceful spanning trees in a complete graph is proposed. An algorithm to generate all the labeled spanning trees in a complete graph is developed and modified to generate all graceful spanning trees.
Mehendale, Dhananjay P.
core
Topological Integer Additive Set-Sequential Graphs
, 2015 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
Improper Graceful and Odd-graceful Labellings of Graph Theory
, 2015 In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having ...
Wang, Hongyu, Xu, Jin, Yao, Bing
openaire +2 more sources
Advanced Intelligent Systems, EarlyView.The first biometric framework to harness dynamic time warping (DTW) for single‐channel diaphragmatic surface electromyography authentication via post‐hoc alignment is presented. By optimally warping deep–normal–deep breath cycles, DTW achieves perfect genuine–impostor separation (equal error rates = 0%), while a parallel adaptive neuro‐fuzzy inference ...
Beyza Eraslan +2 more
wiley +1 more source
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Entropy (Basel), 2023 Zhao M, Wang H, Yao B.
europepmc +1 more source
Two Rosa-type Labelings of Uniform k-distant Trees and a New Class of Trees [PDF]
, 2015 A k-distant tree consists of a main path, called the spine, such that each vertex on the spine is joined by an edge to an end-vertex of at most one path on at most k vertices.
Wenger Diller, Kimberly
core +1 more source
A new graceful labeling for pendant graphs [PDF]
Aequationes mathematicae, 2013 A graceful labeling of a graph G with q edges is an injective assignment of labels from {0, 1, . . . , q} to the vertices of G so that when each edge is assigned the absolute value of the difference of the vertex labels it connects, the resulting edge labels are distinct.
openaire +2 more sources
Advanced Contactless Bioassembly Approaches: Leveraging Sound, Optical, and Magnetic Fields
Advanced NanoBiomed Research, EarlyView.This review explores innovative contactless bioassembly techniques driven by sound, light, and magnetic fields, which enable the precise organization of cells, biomaterials, and bioactive substances into complex 3D structures. These technologies, crucial for in vitro modeling and regenerative medicine, are examined in detail, highlighting their ...
Micaela Natta +4 more
wiley +1 more source