Related papers: Reflective Graphs, Ollivier curvature, effective d…
The Evasiveness conjecture have been proved for properties of graphs on a prime-power number of vertices and the six vertices case. The ten vertices case is still unsolved. In this paper we study the size of the automorphism group of a…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
We consider a formal discretisation of Euclidean quantum gravity defined by a statistical model of random $3$-regular graphs and making using of the Ollivier curvature, a coarse analogue of the Ricci curvature. Numerical analysis shows that…
Self-shrinkers are important geometric objects in the study of mean curvature flows, while the Bernstein Theorem is one of the most profound results in minimal surface theory. We prove a Bernstein type result for graphical self-shrinker…
Solving a conjecture of M. H. Freedman, L. Lov\'asz and A. Schrijver we prove that a graph parameter is edge reflection positive and multiplicative if and only if it can be represented by an edge coloring model.
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
We show that if a planar graph $G$ with minimum degree at least $3$ has positive Lin-Lu-Yau Ricci curvature on every edge, then $\Delta(G)\leq 17$, which then implies that $G$ is finite. This is an analogue of a result of DeVos and Mohar…
In this paper, we present extensions of the classical Bonnet-Myers theorem for Riemannian manifolds with nonnegative Ricci curvature. Our results provide criteria for compactness and a method for estimating the diameter of such manifolds…
Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
The modelling of interconnection networks by graphs motivated the study of several extremal problems that involve well known parameters of a graph (degree, diameter, girth and order) and ask for the optimal value of one of them while…
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…