相关论文: From Invariants to Canonization in Parallel

For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph…

Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(\Phi(x,y))$ as edges. We study the following problem:…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…

We study the complexity of the following related computational tasks concerning a fixed countable graph G: 1. Does a countable graph H provided as input have a(n induced) subgraph isomorphic to G? 2. Given a countable graph H that has a(n…

Given a 3-uniform hypergraph H, its 2-intersection graph G has for vertex set the hyperedges of H and ee' is an edge of G whenever e and e' have exactly two common vertices in H. Di Marco et al. prove that deciding wether a graph G is the…

We define $G$-cospectrality of two $G$-gain graphs $(\Gamma,\psi)$ and $(\Gamma',\psi')$, proving that it is a switching isomorphism invariant. When $G$ is a finite group, we prove that $G$-cospectrality is equivalent to cospectrality with…

We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.

In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…

For a graph $F$, a graph $G$ is \emph{$F$-free} if it does not contain an induced subgraph isomorphic to $F$. For two graphs $G$ and $H$, an \emph{$H$-coloring} of $G$ is a mapping $f:V(G)\rightarrow V(H)$ such that for every edge $uv\in…

Soient donn\'es deux graphes $\Gamma_1$, $\Gamma_2$ \`a $n$ sommets. Sont-ils isomorphes? S'ils le sont, l'ensemble des isomorphismes de $\Gamma_1$ \`a $\Gamma_2$ peut \^etre identifi\'e avec une classe $H \pi$ du groupe sym\'etrique sur…

We give an isomorphism test that runs in time $n^{\operatorname{polylog}(h)}$ on all $n$-vertex graphs excluding some $h$-vertex vertex graph as a topological subgraph. Previous results state that isomorphism for such graphs can be tested…

In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

A bipartite graph $G=(A,B,E)$ is ${\cal H}$-convex, for some family of graphs ${\cal H}$, if there exists a graph $H\in {\cal H}$ with $V(H)=A$ such that the set of neighbours in $A$ of each $b\in B$ induces a connected subgraph of $H$.…

For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs…

Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…

We show that the graph construction used to prove that a gauge-invariant ideal of a graph C*-algebra is isomorphic to a graph C*-algebra, and also used to prove that a graded ideal of a Leavitt path algebra is isomorphic to a Leavitt path…

Recently, Man\v{c}inska and Roberson proved that two graphs $G$ and $G'$ are quantum isomorphic if and only if they admit the same number of homomorphisms from all planar graphs. We extend this result to planar #CSP with any pair of sets…

Graphons are symmetric measurable functions that arise from a sequence of graphs. A graphon variety is the a set of all graphons defined by a condition of the form $t(g, W) = 0$ for a fixed quantum graph $g$, where $t(.,.)$ is the…