213 research outputs found
No finite -regular matchstick graph exists
A graph is called a unit-distance graph in the plane if there is an
injective embedding of in the plane such that every pair of adjacent
vertices are at unit distance apart. If additionally the corresponding edges
are non-crossing and all vertices have the same degree we talk of a regular
matchstick graph. Due to Euler's polyhedron formula we have . The
smallest known -regular matchstick graph is the so called Harborth graph
consisting of vertices. In this article we prove that no finite
-regular matchstick graph exists.Comment: 15 pages, 12 figures, 2 table
Planar graphs : a historical perspective.
The field of graph theory has been indubitably influenced by the study of planar graphs. This thesis, consisting of five chapters, is a historical account of the origins and development of concepts pertaining to planar graphs and their applications. The first chapter serves as an introduction to the history of graph theory, including early studies of graph theory tools such as paths, circuits, and trees. The second chapter pertains to the relationship between polyhedra and planar graphs, specifically the result of Euler concerning the number of vertices, edges, and faces of a polyhedron. Counterexamples and generalizations of Euler\u27s formula are also discussed. Chapter III describes the background in recreational mathematics of the graphs of K5 and K3,3 and their importance to the first characterization of planar graphs by Kuratowski. Further characterizations of planar graphs by Whitney, Wagner, and MacLane are also addressed. The focus of Chapter IV is the history and eventual proof of the four-color theorem, although it also includes a discussion of generalizations involving coloring maps on surfaces of higher genus. The final chapter gives a number of measurements of a graph\u27s closeness to planarity, including the concepts of crossing number, thickness, splitting number, and coarseness. The chapter conclused with a discussion of two other coloring problems - Heawood\u27s empire problem and Ringel\u27s earth-moon problem
Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations
One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology
Trace formulae for three-dimensional hyperbolic lattices and application to a strongly chaotic tetrahedral billiard
This paper is devoted to the quantum chaology of three-dimensional systems. A
trace formula is derived for compact polyhedral billiards which tessellate the
three-dimensional hyperbolic space of constant negative curvature. The exact
trace formula is compared with Gutzwiller's semiclassical periodic-orbit theory
in three dimensions, and applied to a tetrahedral billiard being strongly
chaotic. Geometric properties as well as the conjugacy classes of the defining
group are discussed. The length spectrum and the quantal level spectrum are
numerically computed allowing the evaluation of the trace formula as is
demonstrated in the case of the spectral staircase N(E), which in turn is
successfully applied in a quantization condition.Comment: 32 pages, compressed with gzip / uuencod
A New Euler's Formula for DNA Polyhedra
DNA polyhedra are cage-like architectures based on interlocked and interlinked DNA strands. We propose a formula which unites the basic features of these entangled structures. It is based on the transformation of the DNA polyhedral links into Seifert surfaces, which removes all knots. The numbers of components , of crossings , and of Seifert circles are related by a simple and elegant formula: . This formula connects the topological aspects of the DNA cage to the Euler characteristic of the underlying polyhedron. It implies that Seifert circles can be used as effective topological indices to describe polyhedral links. Our study demonstrates that, the new Euler's formula provides a theoretical framework for the stereo-chemistry of DNA polyhedra, which can characterize enzymatic transformations of DNA and be used to characterize and design novel cages with higher genus
Euler Characteristic of Polyhedral Graphs
Euler characteristic is a topological invariant, a number that describes the shape or structure of a topological space, irrespective of the way it is bent. Many operations on topological spaces may be expressed by means of Euler characteristic. Counting polyhedral graph figures is directly related to Euler characteristic. This paper illustrates the Euler characteristic involvement in figure counting of polyhedral graphs designed by operations on maps. This number is also calculated in truncated cubic network and hypercube. Spongy hypercubes are built up by embedding the hypercube in polyhedral graphs, of which figures are calculated combinatorially by a formula that accounts for their spongy character. Euler formula can be useful in chemistry and crystallography to check the consistency of an assumed structure.
This work is licensed under a Creative Commons Attribution 4.0 International License
- …