Results 101 to 110 of about 6,739 (277)
On graceful labelings of trees
, 2018 We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
openaire +2 more sources
Context Awareness and Human–Robot Interaction Optimization for Museum Intelligent Guide Robot
Advanced Intelligent Systems, EarlyView.This study presents a context‐aware human–robot interaction framework designed for intelligent museum guide robots. The system features a three‐layer architecture—perception, understanding, and behavior execution—that enables adaptive and meaningful interactions with museum visitors.
Anna Zou, Yue Meng, Shijing Tong
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
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
Advanced Intelligent Systems, EarlyView.This study provides an introduction to Bayesian optimisation targeted for experimentalists. It explains core concepts, surrogate modelling, and acquisition strategies, and addresses common real‐world challenges such as noise, constraints, mixed variables, scalability, and automation.
Chuan He +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
Advanced Intelligent Systems, EarlyView.Artificial intelligence (AI) is reshaping autonomous mobile robot navigation beyond classical pipelines. This review analyzes how AI techniques are integrated into core navigation tasks, including path planning and control, localization and mapping, perception, and context‐aware decision‐making. Learning‐based, probabilistic, and soft‐computing methods
Giovanna Guaragnella +5 more
wiley +1 more source
Graceful labeling of triangular extension of complete bipartite graph
Electronic Journal of Graph Theory and Applications, 2019 For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km, n ⊙ K2 as triangular extension of complete bipartite graph Km, n, since there is a triangle hanging from every vertex of Km, n.
Sarbari Mitra, Soumya Bhoumik
doaj +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
On $k$-Super Graceful Labeling of Graphs
, 2018 Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$-super graceful labeling of $G$.
Lau, Gee-Choon +2 more
openaire +3 more sources