Results 41 to 50 of about 6,219 (246)
Graph isomorphism and Gaussian boson sampling
Special Matrices, 2021 We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed ...
Brádler Kamil +4 more
doaj +1 more source
Subgroup Graphs of Finite Groups
International Journal of Applied Sciences and Smart Technologies, 2021 Let G be a fnite group with the set of subgroups of G denoted by S(G), then the subgroup graphs of G denoted by T(G) is a graph which set of vertices is S(G) such that two vertices H, K in S(G) (H not equal to K) are adjacent if either H is a subgroup of
Ojonugwa Ejima +2 more
doaj +1 more source
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
Approximate Graph Isomorphism [PDF]
, 2012 We study optimization versions of Graph Isomorphism. Given two graphs G1,G2, we are interested in finding a bijection π from V(G1) to V(G2) that maximizes the number of matches (edges mapped to edges or non-edges mapped to non-edges).
Vikraman Arvind +3 more
openaire +2 more sources
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
Graph isomorphism : Some special cases [PDF]
, 1987 This paper investigates some special cases of graphs with a small number of vertices or edges where a characteristic property of the vertices and edges already determines the graph up to isomorphism.
Socher, Rolf
core +1 more source
Reductions to Graph Isomorphism
Theory of Computing Systems, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Constructing Hard Examples for Graph Isomorphism.
, 2020 We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial automorphisms which also ...
core +1 more source
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
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