Related papers: Stable Delaunay Graphs
The Gallai-Milgram theorem says that the vertex set of any digraph with stability number k can be partitioned into k directed paths. In 1990, Hahn and Jackson conjectured that this theorem is best possible in the following strong sense. For…
Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…
The simplest way to make a dynamical system out of a finite connected graph $G$ is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, for each vertex. The phase space $\mathcal{P}(G)$ then…
Let us consider the local specification system of Gibbs point process with inhib ition pairwise interaction acting on some Delaunay subgraph specifically not con taining the edges of Delaunay triangles with circumscribed circle of radius…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
The stability number of a graph G, is the cardinality of a stable set of maximum size in G. If the stability number of G remains the same upon the addition of any edge, then G is called $\alpha ^{+}$-stable. G is a K\"{o}nig-Egervary graph…
An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is…
Deep Graph Networks (DGNs) currently dominate the research landscape of learning from graphs, due to their efficiency and ability to implement an adaptive message-passing scheme between the nodes. However, DGNs are typically limited in…
We introduce a ladder-shaped chain with each rung carrying a $\mathcal{PT}$ -symmetric gain-loss dipole. The polarity of the dipoles is staggered along the chain, meaning that a rung bearing gain-loss is followed by one bearing loss-gain.…
Given a finite set $P\subset\mathbb{R}^2$, the directed Theta-6 graph, denoted $\vec{\Theta}_6(P)$, is a well-studied geometric graph due to its close relationship with the Delaunay triangulation. The $\vec{\Theta}_6(P)$-graph is defined as…
In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a…
Foucaud et al. recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Given a graph $G=(V(G), E(G))$, a set $M \subseteq V(G)$ is a distance-edge-monitoring set if for every edge $e…
We begin to study in this paper orbital and asymptotic stability of standing waves for a model of Schr\"odinger equation with concentrated nonlinearity in dimension three. The nonlinearity is obtained considering a {point} (or contact)…
Understanding which system structure can sustain stable dynamics is a fundamental step in the design and analysis of large scale dynamical systems. Towards this goal, we investigate here the structural stability of systems with a random…
Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line…
The Degasperis-Procesi equation can be derived as a member of a one-parameter family of asymptotic shallow water approximations to the Euler equations with the same asymptotic accuracy as that of the Camassa-Holm equation. In this paper, we…
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points. Asymptotic results are known…
Cooperative dynamics are common in ecology and population dynamics. However, their commonly high degree of complexity with a large number of coupled degrees of freedom renders them difficult to analyse. Here we present a graph-theoretical…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
The cores of edge dislocations, edge dislocation dipoles and edge dislocation loops in planar graphene have been studied by means of periodized discrete elasticity models. To build these models, we have found a way to discretize linear…