Graphs with Eulerian unit spheres
نویسنده
چکیده
d-spheres are defined graph theoretically and inductively as the empty graph in dimension d = −1 and d-dimensional graphs for which all unit spheres S(x) are (d−1)-spheres and such that for d ≥ 0 the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which can be colored with d + 1 colors. They are Eulerian graphs in the classical sense and for d ≥ 2, all unit spheres of an Eulerian sphere are Eulerian spheres. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d− 2)-dimensional sub-simplices in G are even. This generalizes a result of Kempe-Heawood for d = 2 and is work related to the conjecture that all d-spheres have chromatic number d + 1 or d + 2 which is based on the geometric conjecture that every d-sphere can be embedded in an Eulerian (d + 1)-sphere. For d = 2, such an embedding into an Eulerian 3-sphere would lead to a geometric proof of the 4 color theorem, allowing to see “why 4 colors suffice”. To achieve the goal of coloring a d-sphere G with d + 2 colors, we hope to embed it into a (d + 1)-sphere and refine or thin out the later using special homotopy deformations without touching the embedded sphere. Once rendered Eulerian and so (d+ 2)-colorable, it colors the embedded graph G. In order to define the degree of a simplex, we introduce a notion of dual graph Ĥ of a subgraph H in a general finite simple graph G. This leads to a natural sphere bundle over the simplex graph. We look at geometric graphs which admit a unique geodesic flow: their unit spheres must be Eulerian. We define Platonic spheres graph theoretically as d-spheres for which all unit spheres S(x) are graph isomorphic Platonic (d−1)-spheres. GaussBonnet allows a straightforward classification within graph theory independent of the classical Schläfli-Schoute-Coxeter classification: all spheres are Platonic for d ≤ 1, the octahedron and icosahedron are the Platonic 2-spheres, the sixteen and six-hundred cells are the Platonic 3-spheres. The cross polytope is the unique Platonic d-sphere for d > 3. It is Eulerian. Date: January 11, 2015. 1991 Mathematics Subject Classification. Primary: 05C15, 05C10, 57M15 .
منابع مشابه
Line graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملThe irregularity and total irregularity of Eulerian graphs
For a graph G, the irregularity and total irregularity of G are defined as irr(G)=∑_(uv∈E(G))〖|d_G (u)-d_G (v)|〗 and irr_t (G)=1/2 ∑_(u,v∈V(G))〖|d_G (u)-d_G (v)|〗, respectively, where d_G (u) is the degree of vertex u. In this paper, we characterize all connected Eulerian graphs with the second minimum irregularity, the second and third minimum total irregularity value, respectively.
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملLong Circuits and Large Euler Subgraphs
An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be recognized in polynomial time while the problems of finding a maximum Eulerian subgraph or a maximum induced Eulerian subgraph are NP-hard. In this paper, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.03116 شماره
صفحات -
تاریخ انتشار 2015