Results 91 to 100 of about 4,929,609 (209)
Ingeniería Mecánica, 2002 Un problema de importancia primordial en el diseño mecánico es identificar los mecanismos isomorfos, puesto que los isomorfismos nodetectados generan soluciones duplicadas y por tanto suponen un esfuerzo innecesario en el proceso de diseño.
G. Galán Marín +1 more
doaj
On the Limits of Intransitive Coordination
Ratio, EarlyView.ABSTRACT A growing number of authors suggest that concept coordination—the kind of relation we pick out when we say that the concepts of one or more individuals represent something as the same—is not a transitive relation. Here we consider global features of representational systems to break new ground in the assessment of the intransitivity view. From
Víctor M. Verdejo, Joost J. Joosten
wiley +1 more source
We review some of the most relevant properties related to graph isomorphism and graph components. First, we introduce some concepts related to graph traversal (walks, paths, cycles, circuits) and we introduce two natural concepts related to connectivity:
Dondi, Riccardo
core +1 more source
Aggregate, Volume 7, Issue 10, October 2026.This review summarizes recent advances in MOFs for CO2 valorization, covering MOF synthesis, CO2 capture, and photo/electrocatalytic CO2 reduction. Detailed discussion of typical strategies reveals the intrinsic structure–performance relationship, and challenges together with future perspectives are proposed.
Yingjia Li +7 more
wiley +1 more source
Improved Random Graph Isomorphism [PDF]
, 2008 Canonical labeling of a graph consists of assigning a unique label to each vertex such that the labels are invariant under isomorphism. Such a labeling can be used to solve the graph isomorphism problem.
Gopal Pandurangan +3 more
core +1 more source
Extending Undirected Graph Techniques to Directed Graphs via Category Theory
MathematicsWe use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra +4 more
doaj +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Directed Acyclic Graph-Based Datapath Synthesis Using Graph Isomorphism and Gate Reconfiguration
ChipsDatapath synthesis is a crucial step in synthesis flow and aims at globally minimizing an area by identifying shareable logic structures. This paper introduces a novel Directed Acyclic Graph (DAG)-based datapath synthesis method based on graph ...
Liuting Shang +4 more
doaj +1 more source
European Journal of Inorganic Chemistry, Volume 29, Issue 27, 24 September 2026.The rare earth (RE) aqua complexes using 3‐hydroxyphenylacetate ligand were prepared using the corresponding RE salt and the sodium salt of the ligand by a salt metathesis reaction. Two different structural motifs of the complexes, {[La(3hpa)3(H2O)] × 2H2O}n, and [RE(3hpa)3(H2O)]n (RE = Ce (2), Nd (3), Gd (4), Dy (5), Y (6), Er (7), Yb (8)) were ...
Naveena Y. Salpadoru Thuppahige +5 more
wiley +1 more source
Subgraph isomorphism in graph classes [PDF]
, 2012 We investigate the computational complexity of the following restricted variant of Subgraph Isomorphism: given a pair of connected graphs G=(VG,EG) and H=(VH,EH), determine if H is isomorphic to a spanning subgraph of G.
Otachi, Yota +3 more
core +1 more source