Related papers: Univoque graphs and multiple expansions
We formulate a multi-valued version of the Tietze-Urysohn extension theorem. Precisely, we prove that any upper semicontinuous multi-valued map with nonempty closed convex values defined on a closed subset (resp. closed perfectly normal…
We show there exists a closed graph manifold $N$ and infinitely many non-separable, horizontal surfaces $\{S_{n} \to N\}_{n \in \mathbb{N}}$ such that there does not exist a quasi-isometry $\pi_1(N) \to \pi_1(N)$ taking $\pi_1(S_{n})$ to…
A graph $G$ is {\it $n$-existentially closed} if, for all disjoint sets of vertices $A$ and $B$ with $|A\cup B|=n$, there is a vertex $z$ not in $A\cup B$ adjacent to each vertex of $A$ and to no vertex of $B$. In this paper, we investigate…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
Expander graphs have been intensively studied in the last four decades. In recent years a high dimensional theory of expanders has emerged, and several variants have been studied. Among them stand out coboundary expansion and topological…
For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…
Let $E,F$ be two topological spaces and $u:E\rightarrow F$ be a map. \ If $F$ is Haudorff and $u$ is continuous, then its graph is closed. \ \ The Closed Graph Theorem establishes the converse when $E$ and $F$ are suitable objects of…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
We construct an example of a birational transformation of a rational threefold for which the first and second dynamical degrees coincide and are $>1$, but which does not preserve any holomorphic (singular) foliation. In particular, this…
In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph,…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.
A folklore result attributed to P\'olya states that there are $(1 + o(1))2^{\binom{n}{2}}/n!$ non-isomorphic graphs on $n$ vertices. Given two graphs $G$ and $H$, we say that $G$ is a unique subgraph of $H$ if $H$ contains exactly one…
We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide…
We relate the nontrivial singular values $\sigma_2,\ldots,\sigma_n$ of the normalized adjacency matrix of an Eulerian directed graph to combinatorial measures of graph expansion: \\ 1. We introduce a new directed analogue of conductance…
Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…
This paper introduces the notion of an $(\iota,q)$-critical graph. The isolation number of a graph $G$, denoted by $\iota(G)$ and also known as the vertex-edge domination number of $G$, is the size of a smallest subset $D$ of the vertex set…
This paper concerns the expansion of the real ordered additive group by a predicate for a subset of $[0,1]$ whose base-$r$ representations are recognized by a B\"uchi automaton. In the case that this predicate is closed, a dichotomy is…
Expander graphs have many interesting applications in communication networks and other areas, and thus these graphs have been extensively studied in theoretic computer sciences and in applied mathematics. In this paper, we use reversible…
Given a closed orientable Lagrangian surface L in a closed symplectic four-manifold X together with a relative homology class d in H_2 (X, L; Z) with vanishing boundary in H_1 (L; Z), we prove that the algebraic number of J-holomorphic…
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…