Related papers: On Subgraph Isomorphism
In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum…
The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
We consider the polychromatic coloring problems for unions of two or more geometric hypergraphs on the same vertex sets of points in the plane. We show, inter alia, that the union of bottomless rectangles and horizontal strips does in…
The set of subspaces with a given dimension in an attenuated space has a structure of a symmetric association scheme, which is a generalization of both Grassmann schemes and bilinear forms schemes. In [K. Wang, J. Guo, F. Li, Association…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
In this paper we prove a conjecture of Bryant, Griffiths, and Yang concerning the characteristic variety for the determined isometric embedding system. In particular, we show that the characteristic variety is not smooth for any dimension…
This article provides a geometric representation for the well-known isomorphism between the special orthogonal group of an isotropic quadratic space of dimension 3 and the group of projective transformations of a projective line. This…
We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…
A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…
The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000)…
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…
A general (convex) polytope $P\subset\mathbb R^d$ and its edge-graph $G_P$ can have very distinct symmetry properties. We construct a coloring (of the vertices and edges) of the edge-graph so that the combinatorial symmetry group of the…
A morphism of linear algebraic groups $\phi:K\rightarrow G$ is called an epimorphism if it admits right cancellation. A subgroup $H\leq G$ is epimorphic if the inclusion map is an epimorphism. For $G$ a simple algebraic group over an…
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…