Related papers: Every graph is a cut locus

We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.

We showed in another paper [arXiv:1103.1759] that every connected graph can be realized as the cut locus of some point on some riemannian surface $S$. Here, criteria for the orientability of $S$ are given, and are applied to classify the…

We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph.

Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.

Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…

We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…

Let $M$ be a complete Riemannian manifold which either is compact or has a pole, and let $\varphi$ be a positive smooth function on $M$. In the warped product $M\times_\varphi\mathbb R$, we study the flow by the mean curvature of a locally…

We prove that every entire solution of the minimal graph equation that is bounded from below and has at most linear growth must be constant on a complete Riemannian manifold $M$ with only one end if $M$ has asymptotically non-negative…

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…

Let $W(G)$ be the Wiener index of a graph $G$. We say that a vertex $v \in V(G)$ is a \v{S}olt\'es vertex in $G$ if $W(G - v) = W(G)$, i.e. the Wiener index does not change if the vertex $v$ is removed. In 1991, \v{S}olt\'es posed the…

The tau constant is an important invariant of a metrized graph, and it has applications in arithmetic properties of curves. We show how the tau constant of a metrized graph changes under successive edge contractions and deletions. We…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We…

In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.

We show that on any Riemannian surface for each $0<c<\infty$ there exists an immersed $C^{1,1}$ curve that is smooth and with curvature equal to $\pm c$ away from a point. We give examples showing that, in general, the regularity of the…

An integral geometric curvature is defined as the index expectation K(x) = E[i(x)] if a probability measure m is given on vector fields on a Riemannian manifold or on a finite simple graph. Such curvatures are local, satisfy Gauss-Bonnet…

In this paper, we provided conditions for an entire constant mean curvature Killing graph lying inside a possible unbounded region to be necessarily a slice.

Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…

A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…