The Kuenneth formula for graphs

نویسنده

  • Oliver Knill
چکیده

We define a Cartesian product G ×H for finite simple graphs which satisfies the Künneth formula H(G × H) = ⊕i+j=kH(G) ⊗ H(G) and so pG×H(x) = pG(x)pH(y) for the Poincaré polynomial pG(x) = ∑ k=0 dim(H (G))x and χ(G × H) = χ(G)χ(H) for the Euler characteristic χ(G) = pG(−1). The graph G1 = G × K1 is homotopic to G, has a digraph structure and satisfies the inequality dim(G1) ≥ dim(G) and G1. Hodge theory leads to the Künneth identity using the product fg of harmonic forms of G and H. A discrete de Rham cohomology and “partial derivatives” emerge on the product graphs. We show that de Rham cohomology is equivalent to graph cohomology by constructing a chain homotopy. The dimension relation dim(G × H) = dim(G) + dim(H) holds point-wise dim(G × H)(x, y) = dim(G1)(x)+dim(H1)(y) and implies the inequality dim(G×H) ≥ dim(G) + dim(H), mirroring a Hausdorff dimension inequality dimension in the continuum. The chromatic number c(G1) of G1 is smaller or equal than c(G) and c(G × H) ≤ c(G) + c(H) − 1. Indeed, c(G × H) is the maximal n for which there is a Kn subgraph of G × H. The automorphism group of G × H contains Aut(G) × Aut(H). If G ∼ H and U ∼ V are homotopic, then G × U and H × V are homotopic, leading to a product on homotopy classes. If G is k-dimensional geometric meaning that all unit spheres S(x) in G are (k − 1)-discrete spheres, then G1 is kdimensional geometric. And if H is l-dimensional geometric, then G × H is geometric of dimension (k + l). Because the product writes a graph as a polynomial fG of n variables for which the Euler polynomial e(x) = ∑ k vkx k is eG(x) = fG(x, . . . , x) and χ(G) = eG(−1), the product extends to a ring of chains which unlike graphs is closed under the boundary operation δ defining the exterior derivative df(x) = f(δx) and closed under quotients G/A with A ⊂ Aut(G). By gluing graphs, joins or fibre bundles are defined with the same features as in the continuum, allowing to build isomorphism classes of bundles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the arithmetic of graphs

The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by the graph complement operation it is isomorphic to the strong Sabidussi ring with disjoint union as addition. We prove that the Euler characteristic is a ring homomorphism from the strong ring to the in...

متن کامل

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

The reliability Wiener number of cartesian product graphs

Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

متن کامل

On the domination polynomials of non P4-free graphs

A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1505.07518  شماره 

صفحات  -

تاریخ انتشار 2015