English
Related papers

Related papers: Notes on a theorem of Naji

200 papers

Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…

Representation Theory · Mathematics 2026-05-19 Bohan Xing

The isotropic matroid $M[IAS(G)]$ of a looped simple graph $G$ is a binary matroid equivalent to the isotropic system of $G$. In general, $M[IAS(G)]$ is not regular, so it cannot be represented over fields of characteristic $\neq 2$. The…

Combinatorics · Mathematics 2020-02-06 Robert Brijder , Lorenzo Traldi

Four-dimensional CFTs dual to branes transverse to toric Calabi-Yau threefolds have been described by bipartite graphs on a torus (dimer models). We use the theory of dessins d'enfants to describe these in terms of triples of permutations…

High Energy Physics - Theory · Physics 2015-03-17 Vishnu Jejjala , Sanjaye Ramgoolam , Diego Rodriguez-Gomez

In this paper has been proved the pluripolarity of graphs of algebroid functions

Complex Variables · Mathematics 2010-05-10 Zafar Ibragimov

In this paper we give a new characterization of the dual polar graphs, extending the work of Brouwer and Wilbrink on regular near polygons. Also as a consequence of our characterization we confirm a conjecture of the authors on…

Combinatorics · Mathematics 2017-11-20 Zhi Qiao , Jack Koolen

A signed graph has edge signs. A gain graph has oriented edge gains drawn from a group. We define the combination of the two for the abelian case, in which each oriented edge of a signed graph has a gain from an abelian group, concentrating…

Combinatorics · Mathematics 2022-06-22 Laura Anderson , Ting Su , Thomas Zaslavsky

A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary…

Combinatorics · Mathematics 2019-10-25 András Sebő

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

Number Theory · Mathematics 2007-05-23 Fusun Akman

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

Computational Complexity · Computer Science 2012-10-22 Leonid Malinin , Natalia Malinina

Let $R$ be a commutative ring with identity and ${\rm Nil}(R)$ be the set of nilpotent elements of $R$. The nil-graph of ideals of $R$ is defined as the graph $\mathbb{AG}_N(R)$ whose vertex set is $\{I:\ (0)\neq I\lhd R$ and there exists a…

Commutative Algebra · Mathematics 2016-11-14 R. Nikandish , F. Shaveisi

Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…

Combinatorics · Mathematics 2014-12-02 Xiwang Cao , Mei Lu , Daqing Wan , Li-Ping Wang , Qiang Wang

Unmixed bipartite graphs have been characterized by Ravadra and Villarreal independently. Our aim in this paper is to characterize unmixed r-partite graphs under a certain condition, witch is a generalization of villarreal's theorem on…

Combinatorics · Mathematics 2015-11-03 Reza Jafarpoure Golzari , Rashid Zaare-Nahandi

Let $\gamma(G)$ and $i(G)$ be the domination number and the independent domination number of $G$, respectively. Rad and Volkmann posted a conjecture that $i(G)/ \gamma(G) \leq \Delta(G)/2$ for any graph $G$, where $\Delta(G)$ is its maximum…

Combinatorics · Mathematics 2016-07-08 Shaohui Wang , Bing Wei

In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.

Combinatorics · Mathematics 2022-10-04 Manuel Gonzalez Sarabia , Rafael H. Villarreal

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

Combinatorics · Mathematics 2014-04-02 Johannes Carmesin

The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…

Combinatorics · Mathematics 2007-09-24 Christopher J. Hillar , Troels Windfeldt

A frame matroid M is graphic if there is a graph G with cycle matroid isomorphic to M. In general, if there is one such graph, there will be many. Zaslavsky has shown that frame matroids are precisely those having a representation as a…

Combinatorics · Mathematics 2014-04-01 Rong Chen , Matt DeVos , Daryl Funk , Irene Pivotto

We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…

Combinatorics · Mathematics 2012-09-11 Eric Katz

We study the tropicalizations of analytic subvarieties of normal toric varieties over complete non-archimedean valuation fields. We show that a Zariski closed analytic subvariety of a normal toric variety is algebraic if its tropicalization…

Algebraic Geometry · Mathematics 2018-11-27 Ryota Mikami

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

Operator Algebras · Mathematics 2015-01-15 James Emil Avery , Rune Johansen , Wojciech Szymanski