Results 51 to 60 of about 2,669,595 (286)
Motion planning in cartesian product graphs
Discussiones Mathematicae Graph Theory, 2014 Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole.
Deb Biswajit, Kapoor Kalpesh
doaj +1 more source
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Transactions on Combinatorics, 2017 Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj +1 more source
Cartesian product stabilization of 3-manifolds [PDF]
, 2010 The Cartesian product of a closed, orientable prime geometric 3-manifold and a closed orientable surface is unique except for the case of the Cartesian product of a special class of Seifert manifolds and a torus.
Witold Rosicki +3 more
core +1 more source
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
When is Cartesian product a Cayley graph? [PDF]
, 2023 A graph is said to be a Cayley graph if its automorphism group admits a regular subgroup. Automorphisms of the Cartesian product of graphs are well understood, and it is known that Cartesian product of Cayley graphs is a Cayley graph.
Hujdurović, Ademir +3 more
core
Cartesian Product Of S•− Valued Graphs
, 2021 The Notion Of S- Valued Graphs Developed In The Year 2015. Later We Study The Different Products In S-Valued Graphs. In Particular, We Studied The Concept Of S-Valued Graphs By Means Of Cartesian Product.
et. al., M. Abirami ,
core +1 more source
Advanced Engineering Materials, EarlyView.The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ +19 more
wiley +1 more source
Advanced Functional Materials, EarlyView.HfxZr1−xO2${\rm Hf}_x{\rm Zr}_{1-x}{\rm O}_2$ offers CMOS‐compatible nanoscale ferroelectricity yet suffers from a high Ec${\rm E}_c$ demanding large operating voltages. A unified phase‐field framework spanning AFE/FE/DE phases shows how FE grains soften neighboring AFE grains over λ$\lambda$ ≈$\approx$ 22–37 nm.
P. Pankaj +4 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Inspired by skeletal muscles’ precision and endurance, CoilLCE integrates a self‐sensing liquid crystal elastomer/graphene artificial muscle with an embedded Joule‐heating copper coil, enabling closed‐loop multistage actuation with programmable intermediate states (strain accuracy of 2%), and antagonistic coordination (32% total strain). These features
Ziyun Zhang +9 more
wiley +1 more source
On a product of universal hyperalgebras
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 We introduce and study a new operation of product of universal hyperalgebras which lies, with respect to set inclusion, between the cartesian product of the hyperalgebras and the cartesian product of their idempotent hulls.
Chaisansuk Nitima, Šlapal Josef
doaj +1 more source