Related papers: Flip Graphs on Self-Complementary Ideals of Chain …
A perfect code in a graph is an independent set of the graph such that every vertex outside the set is adjacent to exactly one vertex in the set. A circulant graph is a Cayley graph of a cyclic group. In this paper we study perfect codes in…
We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…
Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…
Consider a sequence of LexBFS vertex orderings {\sigma}1, {\sigma}2, . . . where each ordering {\sigma}i is used to break ties for {\sigma}i+1. Since the total number of vertex orderings of a finite graph is finite, this sequence must end…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…
In this paper, we introduce some reduction processes on graphs which preserve the regularity of related edge ideals. As a consequence, an alternative proof for the theorem of R. Fr\"oberg on linearity of resolution of edge ideal of graphs…
We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…
Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…
In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like ``pegging moves'' allowed. Motivated by well-studied questions in graph pebbling, we introduce two pegging quantities. The pegging…
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…
Enumerating minimal transversals in a hypergraph is a notoriously hard problem. It can be reduced to enumerating minimal dominating sets in a graph, in fact even to enumerating minimal dominating sets in an incomparability graph. We provide…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for K\"onig-Egerv\'ary graphs…
The aim of this work is to study the Airy and Schr\"odinger operators on looping-edge graphs, a class of metric graphs consisting of a circle and a finite number $N$ of infinite half-lines attached to a common vertex. For the Airy operator,…
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$. We also prove a lemma that is helpful to determine the…
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…