Related papers: Graphical zonotopes with the same face vector
Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Hence, the task is formalized as maximum common subgraph…
In the present paper we construct a one-to-one correspondence between the set of graph-knots and the set of homotopy classes of looped graphs. Moreover, the graph-knot and the homotopy class constructed from a given knot are related with…
In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study of simultaneous representations is the sunflower case where…
An analytic classification of generic anti-polynomial vector fields $\dot z = \overline{P(z)}$ is given in term of a topological and an analytic invariants. The number of generic strata in the parameter space is counted for each degree of…
An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. $z$-knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of…
Generative adversarial networks (GANs) synthesize realistic images from a random latent vector. While many studies have explored various training configurations and architectures for GANs, the problem of inverting a generative model to…
Let $X$ be a family of graphs and $X_n$ the set of $n$-vertex graphs in $X$. A graph $U^{(n)}$ containing all graphs from $X_n$ as induced subgraphs is called $n$-universal for $X$. Moreover, we say that $U^{(n)}$ is a proper $n$-universal…
We extend the definition of an orbit portrait to the context of non-autonomous iteration, both for the combinatorial version involving collections of angles and for the dynamic version involving external rays where combinatorial portraits…
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the…
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
Interior and exterior angle vectors of polytopes capture curvature information at faces of all dimensions and can be seen as metric variants of $f$-vectors. In this context, Gram's relation takes the place of the Euler--Poincar\'e relation…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…
We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of planar graphs that cannot be represented by pentagons. We also…
The interior angle vector ($\widehat{\alpha}$-vector) of a polytope is a metric analogue of the $f$-vector in which faces are weighted by their solid angle. For simplicial polytopes, Dehn-Sommerville-type relations on the…
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with…
In this purely experimental work we try to represent the set of plane maps with 3 vertices and 3 faces as a bipartite ribbon graph. In particular, this construction allows one to estimate the genus of the initial set.
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully used for general object detection and recognition, only…