Results 31 to 40 of about 317 (167)
Geometric Simultaneous Embeddings of a Graph and a Matching
Journal of Graph Algorithms and Applications, 2011 The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is plane.
Sergio Cabello +5 more
doaj +1 more source
On Generalized Topological Indices for Some Special Graphs
Journal of Mathematics, 2022 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
Advanced Robotics Research, EarlyView.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
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
Advanced Robotics Research, EarlyView.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
Exact Resolving Domination Numbers of Wheel-Derived Graphs With an ILP Formulation
International Journal of Mathematics and Mathematical SciencesLet G=V,E be a simple, connected graph, and let da,g denote the shortest distance between vertices a and g. An ordered subset R of V, with R=k and k∈N, is known as a resolving set if, for m≠c,∃t∈R such that dm,t≠dc,t, ∀m, c ∈ V–R.
M. Valentina Gladia +2 more
doaj +1 more source
The coalescence of multi-wheel and starlike graphs is DLS [PDF]
Journal of Mahani Mathematical ResearchThe 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
Advanced Robotics Research, EarlyView.Autonomous field robots equipped with ISFET‐based sensors enable rapid, spatially resolved soil nutrient analysis directly in the field. An automated system based on the BoniRob platform is presented for standardized on‐site extraction and measurement of key macronutrients and soil pH.
Vadim Riedel +3 more
wiley +1 more source
Flexible Sensors for Robotics Tactile Perception: A Review
Advanced Robotics Research, EarlyView.Flexible tactile sensing for robotics is reviewed through four interconnected dimensions. Physical mechanisms include piezoresistive, capacitive, piezoelectric, triboelectric, iontronic, and optical sensing. Structural design includes bioinspired, defect‐based, and MEMS‐based tactile systems.
Yu Song, Ying Chen, Yihao Chen, Xue Feng
wiley +1 more source
Complexity of Join and Corona graphs and Chebyshev polynomials
Journal of Taibah University for Science, 2018 Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source