Results 91 to 100 of about 740,582 (289)
On the Complexity of Stacked Graphs Associated with Paths and Cycles
The complexity of a graph, defined as its number of spanning trees, serves as a key measure of network reliability. Stacked graphs constitute a significant and versatile class of graphs, formed by superimposing multiple copies of a base graph upon a ...
Salama Nagy Daoud, Ahmad Asiri
doaj +1 more source
This article reviews the current state of bioinspired soft robotics. The article discusses soft actuators, soft sensors, materials selection, and control methods used in bioinspired soft robotics. It also highlights the challenges and future prospects of this field.
Abhirup Sarker +2 more
wiley +1 more source
On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs
The BC-subtree (a subtree in which any two leaves are at even distance apart) number index is the total number of non-empty BC-subtrees of a graph, and is defined as a counting-based topological index that incorporates the leaf distance constraint.
Yu Yang, Long Li, Wenhu Wang, Hua Wang
doaj +1 more source
For a graph $H$, the Turán number of $H$, denoted by ex$(n,H)$, is the maximum number of edges of an $n$-vertex $H$-free graph. Let $g(n,H)$ denote the maximum number of edges not contained in any monochromatic copy of $H$ in a $2$-edge-coloring of $K_n$. A wheel $W_m$ is a graph formed by connecting a single vertex to all vertices of a cycle of length
openaire +2 more sources
It is a fact that slippage causes tracking errors in both longitudinal and lateral directions which results to have less travel distance in tracking a reference trajectory. Less travel distance means having energy loss of the battery and carrying loads less than planned.
Gokhan Bayar +2 more
wiley +1 more source
Optimal radio labelings of graphs [PDF]
Devsi Bantva
doaj +1 more source
Contact Force Estimation in the Railway Vehicle Wheel-Rail Interface [PDF]
Increased patronage of railways in the UK in the past 20 years has put demands on rolling stock to operate at peak availability with reduced time available for maintenance.
Ward, Christopher P. +10 more
core +1 more source
Programmable Flocks: Hierarchical Swarm Control via Dynamic Parameter Injection
We present a method for the control of robot swarms which allows the shaping and the translation of patterns of simple robots (“smart particles”), using two types of devices. These two types represent a hierarchy: a larger group of simple, oblivious robots (which we call the workers) that is governed by simple local attraction forces and a smaller ...
Vivek Shankar Varadharajan +1 more
wiley +1 more source
A graph rewriting programming language for graph drawing [PDF]
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
A hybrid mobile robot with a modular Variable‐Stiffness Bridge transitions between a rigid locomotion platform and a flexible, shape‐conforming body. By enclosing objects within its deformable structure rather than relying on dedicated end effectors, the robot achieves orientation‐regulated planar transport, with conformal contact quality shown to ...
Luiza Labazanova +5 more
wiley +1 more source

