相关论文: Signed quivers, symmetric quivers, and root system…
A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is called sign-unbalanced. A nut graph has a one…
A signed graph $\Sigma$ is a pair $(G,\sigma)$, where $G=(V,E)$ is the underlying graph in which each edge is assigned $+1$ or $-1$ by the signature function $\sigma:E\rightarrow\{-1,+1\}$. In this paper, we extend the extensively applied…
This paper is a survey on invariants of representations of quivers and their generalizations. We present the description of generating systems for invariants and relations between generators.
We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…
To each symmetrizable Cartan matrix, we associate a finite free EI category. We prove that the corresponding category algebra is isomorphic to the algebra defined in [C. Geiss, B. Leclerc, and J. Schr\"{o}er, Quivers with relations for…
A signed graph is a graph whose edges are given (-1,+1) weights. In such a graph, the sign of a cycle is the product of the signs of its edges. A signed graph is called balanced if its adjacency matrix is similar to the adjacency matrix of…
Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions,…
We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.
Numerical functions, which characterize Dynkin schemes, Coxeter graphs and tame marked quivers, are considered.
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…
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed…
Let $(Q,\sigma)$ be a symmetric quiver, where $Q=(Q_0,Q_1)$ is a finite quiver without oriented cycles and $\sigma$ is a contravariant involution on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
A signed graph is a graph whose edges are labelled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles.…
An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented…
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…
A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on a…
In this paper, we introduce new representation and characterization of the weighted core inverse of matrices. Several properties of these inverses and their interconnections with other generalized inverses are also explored. Through…
We introduce a new concept of mixed representations of quivers that is a generalization of ordinary representations of quivers and orthogonal (symplectic) representations of symmetric quivers introduced recently by Derksen and Weyman. We…