Related papers: Signed projective cubes, a homomorphism point of v…
To each permutation $\sigma$ in $S_{n}$ we associate a triangulation of a fixed $(n+2)$-gon. We then determine the fibers of this association and show that they coincide with the sylvester classes depicted By Novelli, Hivert and Thibon. A…
We study homomorphism problems of signed graphs from a computational point of view. A signed graph $(G,\Sigma)$ is a graph $G$ where each edge is given a sign, positive or negative; $\Sigma\subseteq E(G)$ denotes the set of negative edges.…
We say that a signed graph is $k$-critical if it is not $k$-colorable but every one of its proper subgraphs is $k$-colorable. Using the definition of colorability due to Naserasr, Wang, and Zhu that extends the notion of circular…
Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much…
We define a special sort of weighted oriented graphs, signed quivers. Each of these yields a symmetric quiver, i.e., a quiver endowed with an involutive anti-automorphism and the inherited signs. We develop a representation theory of…
Given a signed bipartite graph $(B, \pi)$ of negative girth $2k$, we present a necessary and sufficient condition for it to have the following property: each signed bipartite graph $(G, \sigma)$ whose negative girth is at least $2k$ and…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
The spined cube $SQ_n$ is a variant of the hypercube $Q_n$, introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for parallel computing. A graph $\G$ is an $m$-Cayley graph if its…
A signified graph is a pair $(G, \Sigma)$ where $G$ is a graph, and $\Sigma$ is a set of edges marked with '$-$'. Other edges are marked with '$+$'. A signified coloring of the signified graph $(G, \Sigma)$ is a homomorphism into a…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…
We study real nonsingular projective cubic fourfolds up to deformation equivalence combined with projective equivalence and prove that they are classified by the conjugacy classes of involutions induced by the complex conjugation in the…
A signed graph is a graph in which each edge has a positive or negative sign. In this article, first we characterize the distance compatibility in the case of a connected signed graph and discussed the distance compatibility criterion for…
Werner Meyer constructed a cocycle in $H^2(Sp(2g, \mathbb{Z}); \mathbb{Z})$ which computes the signature of a closed oriented surface bundle over a surface, with fibre a surface of genus g. By studying properties of this cocycle, he also…
Skein algebras of surfaces quantize character varieties of topological surfaces, and in low genus, these quantizations are often related to algebras arising in representation theory. For example, Terwilliger defined a universal $SL_2$…
A long-standing conjecture of Berge suggests that every bridgeless cubic graph can be expressed as a union of at most five perfect matchings. This conjecture trivially holds for $3$-edge-colourable cubic graphs, but remains widely open for…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
This work explores the interplay between quantum information theory, algebraic geometry, and number theory, with a particular focus on multiqubit systems, their entanglement structure, and their classification via geometric embeddings. The…
In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…