相关论文: Eccentricities in the flip-graphs of convex polygo…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance between $v$ and any other vertex of $G$. The diameter of a graph $G$ is the maximum eccentricity of a vertex in $G$. The eccentric connectivity index of a connected…

The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that…

We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if…

Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…

Let ${\cal T}$ be a triangulation of a set ${\cal P}$ of $n$ points in the plane, and let $e$ be an edge shared by two triangles in ${\cal T}$ such that the quadrilateral $Q$ formed by these two triangles is convex. A {\em flip} of $e$ is…

We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…

Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…

Let $G$ be a connected finite graph with vertex set $V(G)$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is defined as $\frac{1}{|V(G)|}\sum_{v \in…

The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity $ecc (G)$ of a graph $G$ is the mean value of eccentricities of all vertices of $G$. The average eccentricity is deeply connected…

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…

The total eccentricity index of a connected graph is defined as sum of the eccentricities of all its vertices. We denote the set of all connected graphs on $n$ vertices with $k$ pendant vertices by $\mathfrak{H}_{n,k}$ and denote the set of…

We show that every triangulation (maximal planar graph) on $n\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity…

In a connected graph G, the distance between two vertices of G is the length of a shortest path between these vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex of G. The total-eccentricity…

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…

We revisit here a fundamental result on planar triangulations, namely that the flip distance between two triangulations is upper-bounded by the number of proper intersections between their straight-segment edges. We provide a complete and…

It is known that the flip distance between two triangulations of a convex polygon is related to the minimum number of tetrahedra in the triangulation of some polyhedron. It is interesting to know whether these two numbers are the same. In…

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…