Constructing certain families of 3‐polytopal graphs

DOI10.1002/JGT.22882MaRDI QIDQ6046684zbMATH OpenOpenAlexFDO

Authors Riccardo W. Maffucci

Publication date 6 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

algorithmpolyhedrondegree sequenceplanar graph3-polytopevalency

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Vertex degrees (05C07) Structural characterization of families of graphs (05C75)

Abstract: Let $ngeq3$ and $r_n$ be a $3$-polytopal graph such that for every $3leqileqn$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A dual statement may be formulated for faces of $3$-polytopes. The ideas behind the algorithm generalise readily to solve related problems. Moreover, given a $3$-polytope $t_l$ comprising a vertex of degree $i$ for all $3leqileql$, $l$ fixed, we define an algorithm to output for $n>l$ a $3$-polytope $t_n$ comprising a vertex of degree $i$, for all $3leqileqn$, and such that the initial $t_l$ is a subgraph of $t_n$. The vertex count of $t_n$ is asymptotically optimal, in the sense that it matches the aforementioned minimal vertex count up to order of magnitude, as $n$ gets large. In fact, we only lose a small quantity on the coefficient of the second highest term, and this quantity may be taken as small as we please, with the tradeoff of first constructing an accordingly large auxiliary graph.

Recommendations

• Self-dual polyhedra of given degree sequence
• scientific article; zbMATH DE number 4156478
• On smallest 3-polytopes of given graph radius
• A convexity problem in 3-polytopal graphs
• scientific article; zbMATH DE number 4110708

Cites work

• scientific article; zbMATH DE number 558642 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3292643 (Why is no real title available?)
• An existence theorem for simple convex polyhedra
• On Certain Polyhedra
• On Planar Graphical Degree Sequences
• On Sums of Valencies in Planar Graphs
• On face vectors and vertex vectors of convex polyhedra
• On p-vectors of 3-polytopes
• On valences of polyhedra
• Polyhedra with 4 to 8 faces
• Some analogues of Eberhard's theorem on convex polytopes

Cited in

(5)

• On smallest 3-polytopes of given graph radius
• Generating the centrally symmetric 3-polyhedral graphs
• scientific article; zbMATH DE number 599404 (Why is no real title available?)
• Self-dual polyhedra of given degree sequence
• Deciding constructibility of 3-balls with at most two interior vertices

This page was built for publication: Constructing certain families of 3‐polytopal graphs

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