Related papers: On Subgraph Isomorphism

The isomonodromy deformation method is applied to the scaling limits in the linear NxN matrix equations with rational coefficients to obtain the deformation equations for the algebraic curves which describe the local behavior of the reduced…

A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Let X be a flexible variety of F be an isomorphism of closed one-dimensional subschemes of $X$. We develop criteria which guarantee that F extends to au automorphism of X.

It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.

This note will become part of a new paper with more authors.

Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…

Due to its length and several inaccuracies, this article is no longer suggested for reading. Moreover, in the meantime certain results presented herein could be improved by the author in a non-trivial fashion. Instead, the reader is…

A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…

In this paper we introduce a new approach to the concept of multipolynomials and generalize several results of the homogeneous polynomials and symmetric multilinear applications. We also present an abstract approach to the concept of…

Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the…

We report on results about a study of algebraic graph invariants, based on computer exploration, and motivated by graph-isomorphism and reconstruction problems.

We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.

We discuss various aspects of representation of a polynomial as a sum of monomials (for example, uniqueness of such representation and related estimations).

We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the…

Nonlinear supersymmetry is characterized by supercharges to be higher order in bosonic momenta of a system, and thus has a nature of a hidden symmetry. We review some aspects of nonlinear supersymmetry and related to it exotic supersymmetry…

The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…

In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical…