On growing connected -skeletons

DOI10.1016/J.COMGEO.2012.11.009MaRDI QIDQ1947996zbMATH OpenOpenAlexFDO

Authors Andrew Adamatzky

Publication date 29 April 2013

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.1986

zbMATH Keywords

\(\beta \)-skeletonsmorphogenesispattern formationproximity graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of graph theory (05C90)

Abstract: A $$-skeleton, $$, is a planar proximity undirected graph of an Euclidean points set, where nodes are connected by an edge if their lune-based neighbourhood contains no other points of the given set. Parameter $$ determines the size and shape of the lune-based neighbourhood. A $$-skeleton of a random planar set is usually a disconnected graph for $$. With the increase of $$, the number of edges in the $$-skeleton of a random graph decreases. We show how to grow stable $$-skeletons, which are connected for any given value of $$ and characterise morphological transformations of the skeletons governed by $$ and a degree of approximation. We speculate how the results obtained can be applied in biology and chemistry.

Recommendations

• On the hypergraph connectivity of skeleta of polytopes
• On the graph connectivity of skeleta of convex polytopes
• On -skeleton as a subgraph of the minimum weight triangulation
• scientific article; zbMATH DE number 2086250
• On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
• A lower bound for -skeleton belonging to minimum weight triangulations
• Fast algorithms for computing -skeletons and their relatives.
• On (,)-linear connectivity
• A note on \(\beta\)-connectedness
• On the beta number of the joins of graphs

Cites work

• Evaluating the configuration and the travel efficiency on proximity graphs as transportation networks
• How \({\beta}\)-skeletons lose their edges
• On complex zeros of the \(q\)-Potts partition function for a self-dual family of graphs
• Programmable reconfiguration of Physarum machines

Cited in

(2)

• How \({\beta}\)-skeletons lose their edges
• On -skeleton as a subgraph of the minimum weight triangulation

This page was built for publication: On growing connected \(\beta \)-skeletons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947996)