Results 31 to 40 of about 87,870 (251)
Group nilpotency from a graph point of view [PDF]
International Journal of Group Theory, 2023 Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$. In the present
Valentina Grazian +2 more
doaj +1 more source
Between Subgraph Isomorphism and Maximum Common Subgraph [PDF]
, 2017 When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph.
Hoffmann, Ruth +2 more
core +1 more source
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
Isomorphism Checking in GROOVE [PDF]
, 2006 In this paper we show how isomorphism checking can be used as an effective technique for symmetry reduction in graph-based state spaces, despite the inherent complexity of the isomorphism problem.
Rensink, Arend
core +3 more sources
Isomorphic graphs based on isomorphic groups [PDF]
AIP Conference Proceedings, 2019 The present paper is focusing on the connection between the Isomorphic groups and the Isomorphic graphs. We established a few results on the necessary and sufficient condition on the dimension of the graphs, which are isomorphic with respect to the isomorphic groups. We proved those results depending on the Isomorphic groups.
Sivakumar Pathuri +1 more
openaire +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
NLC-2 graph recognition and isomorphism [PDF]
, 2007 NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the class, we propose a $O(n^2 m)$-time algorithm, improving Johansson's ...
B. Courcelle +13 more
core +6 more sources
Practical graph isomorphism, II
Journal of Symbolic Computation, 2014 This is partially a replacement for http://arxiv.org/abs/0804 ...
Brendan D. Mckay, PIPERNO, Adolfo
openaire +3 more sources
Isomorphic bisections of cubic graphs [PDF]
Journal of Combinatorial Theory, Series B, 2021 Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured that the vertices of every cubic graph can be partitioned into two parts that induce isomorphic subgraphs.
Das, S, Pokrovskiy, A, Sudakov, B
openaire +3 more sources
Isomorphism of graph classes related to the circular-ones property [PDF]
, 2012 We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, \Gamma ...
Curtis, Andrew R. +6 more
core +4 more sources