Results 41 to 50 of about 11,128 (261)
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
Let be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that .
Ratnaning Palupi, A. N. M. Salman
doaj +1 more source
Hasil Kali Matriks (Mod 2) pada Graf Roda, Graf Pertemanan dan Graf Bunga
ABSTRAK Pada artikel ini dibahas sifat-sifat hasil kali matriks (mod 2) terkait graf roda, graf pertemanan, dan graf bunga yang grafikal. Beberapa hasil yang diperoleh, A(Wn)A(Wn)(Mod 2) dan A(Wn)A(Sn)(Mod 2) grafikal apabila n=2k+1 dengan Sn merupakan ...
Fransiskus Fran +2 more
doaj +1 more source
Graphs with no induced wheel or antiwheel
A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be ...
openaire +2 more sources
Recent Advances of Slip Sensors for Smart Robotics
This review summarizes recent progress in robotic slip sensors across mechanical, electrical, thermal, optical, magnetic, and acoustic mechanisms, offering a comprehensive reference for the selection of slip sensors in robotic applications. In addition, current challenges and emerging trends are identified to advance the development of robust, adaptive,
Xingyu Zhang +8 more
wiley +1 more source
Modal Analysis of In-Wheel Motor-Driven Electric Vehicle Based on Bond Graph Theory
A half-car vibration model of an electric vehicle driven by rear in-wheel motors was developed using bond graph theory and the modular modeling method. Based on the bond graph model, modal analysis was carried out to study the vibration characteristics ...
Di Tan, Qiang Wang, Yanshou Wu
doaj +1 more source
On Generalized Topological Indices for Some Special Graphs
Topological indices are numeric values associated with a graph and characterize its structure. There are various topological indices in graph theory such as degree-based, distance-based, and counting-related topological indices.
Sheeba Afridi +2 more
doaj +1 more source
Here, we present a textile, wearable capacitive interface enabling multidirectional remote control by dynamically modulating electrode overlap and spacing via a freely gliding upper electrode. A forearm‐mounted prototype drives robotic and media tasks with 12–15 ms latency, maintains < 0.8% drift after 500 cycles, and remains stably functional at 90 ...
Cagatay Gumus +8 more
wiley +1 more source
The coalescence of multi-wheel and starlike graphs is DLS [PDF]
The Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum, it means that it can be identified by this spectrum, it is called $DLS ...
Mohammad Hasan Ahangarani Farahani +1 more
doaj +1 more source
The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs [PDF]
AbstractIn this paper, we study the class of graphs defined by excluding the following structures as induced subgraphs: theta, pyramid, 1‐wheel, and 3‐wheel. We describe the structure of graphs in , and we give a polynomial‐time recognition algorithm for this class. We also prove that ‐free graphs in are 4‐colorable.
Valerio Boncompagni +2 more
openaire +3 more sources
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang +5 more
wiley +1 more source

