Results 131 to 140 of about 64,086 (307)
Partitioning a permutation graph: algorithms and an application. [PDF]
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded size, and describe a real-life application of this problem encountered at a manufacturing company.
Moonen, Linda, Spieksma, Frederik
core
Grip and Grasp: Lizard Claw Inspired Robotic Manipulators
Advanced Robotics Research, EarlyView.Our study identifies the most effective lizard claw shape for use as an end effector in a bioinspired robotic manipulator. By examining key geometric features and combining them into comparative indices, the Crotaphytus collaris claw is found to be the best fit.
Hyeon Lee +4 more
wiley +1 more source
Discrete Mathematics, 1990 An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y and edges uv, vx, xy. The wing-graph W(G) of a graph G is a graph having the same vertex set as G; uv is an edge in W(G) if and only if uv is a wing in G. A graph G is saturated if G is isomorphic to W(G).
openaire +2 more sources
On perfectness of sums of graphs
Discrete Mathematics, 1999 The sum (also known as Cartesian product) \(G+H\) of two graphs \(G= (X,U)\) and \(H= (Y,V)\) has vertex set \(Z= \{(x,y)\mid x\in X, y\in Y\}\) and edge set \(W= \{[(x,y),(x',y')]\mid x= x',[y,y']\in V\) or \(y= y'\), \([x,x']\in U\}\). The authors motivate the study of the characterization of perfect sum graphs through the result that a graph \(G ...
Dominique de Werra, Alain Hertz
openaire +2 more sources
Learning‐Based Soft Robotic Grasping: Recent Progress and Remaining Challenges
Advanced Robotics Research, EarlyView.This review analyzes learning‐based soft robotic grasping from a pipeline‐oriented perspective, encompassing soft gripper design, multimodal sensing, and learning‐based planning and control. It surveys key neural network architectures and benchmark datasets and identifies critical challenges such as sim‐to‐real transfer, generalization, and continual ...
Arnab Majumder +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1990 A colouring of the vertices of a graph is said to be locally perfect if for each vertex x the neighbourhood N(x) of x is coloured by a number of colours which is equal to the cardinality of a maximum clique in N(x). The locally perfect graphs are those graphs for which any subgraph has a locally perfect colouring. It is shown in this paper that locally
openaire +2 more sources
Resonance Graph of Perfect Matchings
, 2019 Let G be a graph with perfect matchings and let C be a set of linearly independent even cycles of G of width at most 2. The resonance graph R(G, C) is a graph with the vertex set M a subset of M(G) such that two vertices Mi and Mj are adjacent if and ...
Aluoch, James
core
On perfect $Gamma$-decompositions of the complete graph
, 2009 Generalizing the well-known concept of an i-perfect cycle system, Pasotti [Pasotti, in press, Australas J Combin] defined a $\Gamma$-decomposition ($\Gamma$-factorization) of a complete graph $K_v$ to be i-perfect if for every edge [x, y] of $K_v$ there ...
A. PASOTTI +5 more
core +1 more source
Advanced Science, EarlyView.We introduce AutomataGPT, a generative pretrained transformer (GPT) trained on synthetic spatiotemporal data from 2D cellular automata to learn symbolic rules. Demonstrating strong performance on both forward and inverse tasks, AutomataGPT establishes a scalable, domain‐agnostic framework for interpretable modeling, paving the way for future ...
Jaime A. Berkovich +2 more
wiley +1 more source
Discrete Mathematics, 1977 AbstractIn this paper perfectness of various products of graphs is considered. The Cartesian product G1 × G2 is perfect iff it has no induced C2n+1 (n ⩾ 2). By considering the various sufficient conditions for the latter condition, perfect Cartesian products are characterized. Similarly perfect tensor products G1 × G2 are characterized and it is proved
G. Ravindra, K. R. Parthasarathy
openaire +2 more sources