Results 41 to 50 of about 87,870 (251)
Chinese Journal of Mechanical Engineering, 2021 Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains (KCs). The detection can be performed accurately by using the similarity of KCs.
Liang Sun +4 more
doaj +1 more source
Isomorphisms of Graph Groups [PDF]
Proceedings of the American Mathematical Society, 1987 Given a graph X X , define the presentation P X PX to have generators the vertices of X X , and a relation x y = y x xy = yx for each pair x , y x,y of adjacent vertices. Let
openaire +2 more sources
Outerplane Bipartite Graphs with Isomorphic Resonance Graphs
Discrete Applied Mathematics, 2023 We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance graphs. Moreover, two additional characterizations are expressed in terms of resonance digraphs and via local ...
Simon Brezovnik +3 more
openaire +5 more sources
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
, 2014 We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We first compute an
A. Bouland +15 more
core +1 more source
Isomorphism test for digraphs with weighted edges [PDF]
, 2018 Colour refinement is at the heart of all the most efficient graph isomorphism software packages. In this paper we present a method for extending the applicability of refinement algorithms to directed graphs with weighted edges.
Piperno, Adolfo
core +2 more sources
Transactions on Networks and Communications, 2017 To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same ...
openaire +3 more sources
Oriented Flip Graphs and Noncrossing Tree Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions.
Alexander Garver, Thomas McConville
doaj +1 more source
Advanced Functional Materials, EarlyView.Tabular foundation model interrogates the synthetic likelihood of metal−organic frameworks. Abstract Metal–organic frameworks (MOFs) are celebrated for their chemical and structural versatility, and in‑silico screening has significantly accelerated their discovery; yet most hypothetical MOFs (hMOFs) never reach the bench because their synthetic ...
Xiaoyu Wu +3 more
wiley +1 more source
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source