Rashit T. Faizullin, Alexander V. Prolubnikov
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we give a partial solution to a new isomorphism problem about $2$-$(v,k,k-1)$ designs from disjoint difference families in finite fields and Galois rings. Our results are obtained by carefully calculating and bounding some block intersection numbers, and we give insight on the limitations of this technique. Moreover, we present results on cyclotomic numbers and on the structure of Galois rings of characteristic $p^2$.
Recently, two new constructions of $(v,k,k-1)$ disjoint difference families in Galois rings were presented by Davis, Huczynska, and Mullen and Momihara. Both were motivated by a well-known construction of difference families from cyclotomy in finite fields by Wilson. It is obvious that the difference families in the Galois ring and the difference families in the finite field are not equivalent. A related question which is in general harder to answer is whether the associated designs are isomorphic or not. In our case, this problem was raised by Davis, Huczynska and Mullen. In this paper we sho…
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that runs in time exp(O(n^(1/3)) (this bound was recently improved to expf O(n^(1/5) [5]). It has since been an open question to remove the requirement that the graph be strongly regular. Recent algorithmic results show that for many problems the Lasserre hierarchy works surprisingly well when the underlying graph has expansion properties. Moreover, recent work of …
The k-th power D^k of a directed graph D is defined to be the directed graph on the vertices of D with an arc from a to b in D^k iff one can get from a to b in D with exactly k steps. This notion is equivalent to the k-fold composition of binary relations or k-th powers of Boolean matrices. A k-th root of a directed graph D is another directed graph R with R^k = D. We show that for each k >= 2, computing a k-th root of a directed graph is at least as hard as the graph isomorphism problem.
This paper outlines a method to determine whether two label-regular directed trees, are isomorphic and when they are almost isomorphic. The approach involves reinterpreting label-regular directed trees as universal covers of rooted graphs. This allows us associate a unique graph with each isomorphism class of a label-regular directed tree. Additionally, by examining the graph monoid we can verify when two unfolding graphs produce almost isomorphic unfolding trees, thereby classifying unfolding trees up to almost isomorphism.
We consider global dynamics of reaction systems as introduced by Ehrenfeucht and Rozenberg. The dynamics is represented by a directed graph, the so-called transition graph, and two reaction systems are considered equivalent if their corresponding transition graphs are isomorphic. We introduce the notion of a skeleton (a one-out graph) that uniquely defines a directed graph. We provide the necessary and sufficient conditions for two skeletons to define isomorphic graphs. This provides a necessary and sufficient condition for two reactions systems to be equivalent, as well as a characterization …
This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all non-cospectral graph pairs are distinguished by the proposed combinatorial method, furthermore, even non-isomorphic cospectral graphs can be distinguished assuming certain properties of their eigenspaces. We also investigate a refinement of the aforementioned labeling, called $\mathfrak{s}^k$-labeling, which has both theoretical and practical applications. Among others,…
In this paper, we study the behaviour of TF-isomorphisms, a natural generalisation of isomorphisms. TF-isomorphisms allow us to simplify the approach to seemingly unrelated problems. In particular, we mention the Neighbourhood Reconstruction problem, the Matrix Symmetrization problem and Stability of Graphs. We start with a study of invariance under TF-isomorphisms. In particular, we show that alternating trails and incidence double covers are conserved by TF-isomorphisms, irrespective of whether they are TF-isomorphisms between graphs or digraphs. We then define an equivalence relation and su…
Siblings of Direct Sums of Chains
本文研究链的直和的兄弟结构数量，证明可数情形仅有一个、可数多个或连续统多个同构类，并将任意基数情形限定为一个或无穷多个，从而证实 Thomassé 猜想。
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e., types of layering). In developing this generalization, we identify multiple types of isomorphisms. For example, in multilayer networks with a single aspect, permuting vertex labels, layer labels, and both vertex labels and layer labels each yield different isomorphism relations between multilayer networks. Multilayer network isomorphisms lead naturally to defining isomorphisms in any of the numerous types of networks that can be represented as a multilayer network, and we thereby obtain isomo…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph complex. This result may have applications in theory of multi-vector fields $T_{\rm poly}^{\geq 1}$ of degree at least one, and to the hairy graph complex which computes the rational homotopy of the space of long knots. The result is generalized to multi-directed graph complexes, showing that all such graph complexes are quasi-isomorphic. These complexes play …
Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.
Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitive tournaments with prime order. For that, we introduce Cayley tournaments, which are special Cayley digraphs, and show that there is a one to one identification between the isomorphism classes of vertex-transitive tournaments with prime order and the isomorphism classes of Cayley tournaments with prime order.
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set Λ_n^k consisting of all n\times n binary matrices having exactly k 1's in every row and every column without perambulating all elements. In the described algorithm bitwise operations are substantially used. In this way it becomes easier to find the solution to the problem for receiving one representative from every equivalence class regarding the introduced in the article equivalence relation in t…
Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
本专著提出以边割谱和边循环谱作为基本数学结构，基于关联矩阵构造图的不变量，证明其独立于顶点和边的编号，并给出判定不可分离图同构的充分必要条件。
Let $G$ and $H$ be two simple graphs. A bijection $ϕ:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(ϕv_i)(ϕv_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that $G = H$, we say $ϕ$ an automorphism of $G$ and denote the group consisting of all automorphisms of $G$ by $\mathrm{Aut}~G$. As well-known, the problem of determining whether or not two given graphs are isomorphic is called Graph Isomorphism Problem (GI). One of key steps in resolving GI is to work out the partition $Π^*_G$ of $V(G)$ composed of orbits of $\mathrm{Aut}~G…
The \emph{power graph} $P(G)$ of a group $G$ is the graph whose vertex set is $G$, with $x$ and $y$ joined if one is a power of the other; the \emph{directed power graph} $\vec{P}(G)$ has the same vertex set, with an arc from $x$ to $y$ if $y$ is a power of $x$. It is known that, for finite groups, the power graph determines the directed power graph up to isomorphism. However, it is not true that any isomorphism between power graphs induces an isomorphism between directed power graphs. Moreover, for infinite groups the power graph may fail to determine the directed power graph. In this paper, …
Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lovász proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$ valued adjacency matrix, the graph homomorphism function $G \mapsto \hom(G, H)$ determines the isomorphism type of $H$. In the past 50 years various extensions have been proved by many researchers [18, 12, 1, 23, 21]. These extend the basic $0$-$1$ case to admit vertex and edge weights; but these extensions all have some restrictions such as all vertex weight…
Gluing diagrams part 1: A constructive solution for the Higman-Thompson group isomorphism problem
本文引入胶合图工具，遵循欧几里得算法构造Higman-Thompson群间的同构，解决了其同构问题的构造性解。
Isomorphisms of graphs of Hyperbinary Expansions and Efficient Algorithms for Stern's Diatomic Sequence
该研究针对非负整数的超二进制展开对应的边标记有向图$A(n)$，分析其圈秩与结构，证明偶数阶图的同构唯一性，推导Stern二原子序列相关公式并讨论相关算法。
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have the same probability. With this technique at hand the paper looks at the special case of the tournament isomorphism problem that stands in the way towards a polynomial-time algorithm for the graph isomorphism problem. Noting that there is a reduction from the automorphism (asymmetry) problem to the isomorphism problem, a reduction in the other direction is …
We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $Λ$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian, Pask and Sims in the positive. Our first proof uses the topological realization of a higher-rank graph, which was introduced by Kaliszewski, Kumjian, Quigg, and Sims. In our more combinatorial second proof, we construct, explicitly and in both directions, maps on the level of (co-)chain complexes that implement said isomorphism. Along the way, we extend the definit…
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built from three tools. A remarkable recent result of Mančinska and Roberson shows that graphs $G$ and $H$ are quantum isomorphic if and only if, for any planar graph $F$, the number of graph homomorphisms from $F$ to $G$ is equal to the number of graph homomorphisms from $F$ to $H$. A generalization of partition functions called "scaffolds" affords some basic re…
The problem of determining (up to lattice isomorphism) which lattices are sublattices of free lattices is in general an extremely difficult and an unsolved problem. A notable result towards solving this problem was established by Galvin and Jónsson when they classified (up to lattice isomorphism) all of the distributive sublattices of free lattices in 1959. In this paper, we weaken the requirement that of a free lattice be distributive to requiring that such a lattice belongs in the variety of lattices generated by the pentagon N5. Specifically, we use McKenzie's list of join-irreducible cover…
Isomorphism of tournaments with bounded VC dimension
本文解决Neuen与Grohe的开放问题，证明有界VC维锦标赛同构问题可在n^{O(d log d)}时间内判定，还证明有界色数锦标赛同构问题可多项式时间判定，开发了同构不变分解等方法。
The directed power graph $\vec{\mathcal G}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph $\mathcal G(\mathbf G)$ of the group $\mathbf G$ is the underlying simple graph. In this paper, we prove that Prüfer group is the only nilpotent group whose power graph does not determine the directed power graph up to isomorphism. Also, we present a group $\mathbf G$ with quasicyclic torsion subgroup that is determined by its power graph up to isomorphism, i.e. such that $\mathcal G(\mathbf H)\cong\mathcal …
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let $\mathcal{H}=\{H_1,H_2,\cdots,H_l\}$ be a finite set of graphs where $|V(H_i)|\leq d$ for all $i$ and for some constant $d$. Let $\mathcal{G}$ be an $\mathcal{H}$-free graph class i.e., none of the graphs $G\in \mathcal{G}$ contain any $H \in \mathcal{H}$ as an induced subgraph. We show that \GI{} parameterized by vertex deletion distance to $\mathcal{G}$ is in a parameterized version of $\AC^1$, denoted $\PL$-$\AC^1$, provided the colored graph isomorphism …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。