Related papers: Graph complexity and Mahler measure

The Mahler measure of a polynomial $P$ in $n$ variables is defined as the mean of $\log|P|$ over the $n$-dimensional torus. For certain polynomials with integer coefficients in two variables the Mahler measure is known to be related to…

An independent dominating set of the simple graph $G=(V,E)$ is a vertex subset that is both dominating and independent in $G$. The independent domination polynomial of a graph $G$ is the polynomial $D_i(G,x)=\sum_{A} x^{|A|}$, summed over…

A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size…

The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation…

It is known from the algebraic graph theory that if $L$ is the Laplacian matrix of some tree $G$ with a vertex degree sequence $\mathbf{d}=(d_1, ..., d_n)^\top$ and $D$ is its distance matrix, then…

This note discusses a relation between the multiplicity m of the second eigenvalue {\lambda}2 of a Laplacian on a graph G, tight mappings of G and a discrete analogue of Courant's nodal line theorem. For a certain class of graphs, we show…

Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…

The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…

Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…

Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

The boxicity of a graph $G$ is the minimum dimension $d$ that admits a representation of $G$ as the intersection graph of a family of axis-parallel boxes in $\mathbb{R}^d$. Computing boxicity is an NP-hard problem, and there are few known…

The problem of combinatorially determining the rank of the 3-dimensional bar-joint {\em rigidity matroid} of a graph is an important open problem in combinatorial rigidity theory. Maxwell's condition states that the edges of a graph $G=(V,…

How to measure the complexity of a finite set of vectors embedded in a multidimensional space? This is a non-trivial question which can be approached in many different ways. Here we suggest a set of data complexity measures using universal…

The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s…

We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…