Related papers: Zero-divisor graphs of lower dismantlable lattices…
We study the divisorial Zariski decomposition on varieties whose first Chern class is zero. We first prove that any exceptional divisor is contractible (up to a birational map that is an isomorphism in codimension one). We then characterize…
A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…
In this paper we study CAT(0) groups and their splittings as graphs of groups. For one-ended CAT(0) groups with isolated flats we prove a theorem characterizing exactly when the visual boundary is locally connected. This characterization…
A graph $G$ is a DTDP-graph if it has a pair $(D,T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$. Such graphs were studied in a number of research papers. In this paper we…
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove that the poset obtained by deleting bottom and top elements from the Galois lattice of a bipartite graph is tree-like if and only if the…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…
Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We…
A fork is a graph obtained from $K_{1,3}$ (usually called claw) by subdividing an edge once. A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and…
This work deals with a special case of family of birational maps f : C2 -> C2 dynamically classified in [9]. In this work we study the zero entropy sub families of f. The sequence of degrees dn associated to the iterates of f is found to…
In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…
The exchange graph of a 2-acyclic quiver is the graph of mutation-equivalent quivers whose edges correspond to mutations. When the quiver admits a nondegenerate Jacobi-finite potential, the exchange graph admits a natural acyclic…
In this paper, we give a new class of reconstructible graphs, which is an extension of my paper `A class of reconstructible graphs'.
We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…
We establish many previously unknown properties of zero-divisors in Cayley-Dickson algebras. The basic approach is to use a certain splitting that simplifies computations surprisingly.
This study examines the tree models of mildly dissipative diffeomorphisms on the disk $\D$. These models are one-dimensional dynamical systems with ergodic aperiodic data as well as some properties of the original dynamics. The focus of…