Results 41 to 50 of about 793,315 (170)
Pelabelan Harmonis Ganjil pada Graf Ular Jaring Berlipat [PDF]
, 2020 Graphs that have odd harmonious labeling properties are called odd harmonious graphs. The purpose of this study to obtain a new graph class construction with its properties, but also to prove that the new graph class has odd harmonious labeling ...
Firmansah, Fery
core +1 more source
Updatable Closed‐Form Evaluation of Arbitrarily Complex Multiport Network Connections
Advanced Electronic Materials, EarlyView.The inverse design of electrically large wave devices often uses reduced‐order multiport models with discrete optimization, requiring many evaluations of complex interconnections between subsystems that differ only in a few blocks. This paper introduces a closed‐form framework enabling efficient Woodbury low‐rank updates of related, previous ...
Hugo Prod'homme, Philipp del Hougne
wiley +1 more source
Behaviorally Adaptive and Inclusive Advanced Driver‐Assistance Systems
Advanced Intelligent Systems, EarlyView.Advanced driver‐assistance systems (ADASs) are mapped as evolving human‐centered, adaptive technologies linking sensing, driver monitoring, AR/HUD interfaces, patents, regulation, and inclusive design. The review identifies gaps in real‐world evidence, diverse‐driver validation, gaze metrics, and governance, outlining a roadmap for safer, behaviorally ...
Jana Skirnewskaja +2 more
wiley +1 more source
Advanced Intelligent Systems, EarlyView.An large language model‐powered multimodal framework is developed for robotic endoscope control. It integrates speech recognition and real‐time instrument tracking, achieving 89.47% command accuracy with ~1s latency for natural human–robot interaction in minimally invasive surgery.
Yisen Huang +7 more
wiley +1 more source
ODD HARMONIOUS LABELINGS OF CYCLIC SNAKES
, 2013 In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ≥ 1. In this paper we generalize this result on cycles by showing that the kCn − snake with string 1,1,…,1 when n ≡ 0 (mod 4) are odd harmonious graph.
M. E. Abdel-Aal +1 more
core +1 more source
A Geometric Characterization of Steady Laminar Flow
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We study the steady states of the Euler equations on the periodic channel or annulus. We show that if these flows are laminar (layered by closed non‐contractible streamlines which foliate the domain), then they must be either parallel or circular flows.
Theodore D. Drivas, Marc Nualart
wiley +1 more source
Even-Odd Harmonious Labeling of Certain Family of Cyclic Graphs
International Journal of Innovative Technology and Exploring Engineering, 2020 An even-odd harmonious labeling of a graph G with p vertices and q edges is a process of assigning odd numbers 1,3,5,...,2q 1 to the vertices through a 1-1 computing function f and even numbers 0, 2, 4,..., 2( p 1) to the edges through a bijective computing function f * with the condition that f *(e uv) ( f (u) f (v))(mod 2q) where u and v are ...
M. Kalaimathi*, Dr. B. J. Balamurugan
openaire +1 more source
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
On Odd Covers of Cliques and Disjoint Unions
Journal of Graph Theory, EarlyView.ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Properly even harmonious labeling of a union of stars
Electronic Journal of Graph Theory and ApplicationsA function f is defined as an even harmonious labeling on a graph G with q edges if f : V(G)→{0, 1, …, 2q} is an injection and the induced function f* : E(G)→{0, 2, …, 2(q − 1)} defined by f*(uv)=f(u)+f(v) (mod2q) is bijective. A properly even harmonious
Zachary M. Henderson
doaj +1 more source