Abstract
Purchase PDF (580 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (2)
Purchase PDF (620 K)
doi:10.1016/0012-365X(94)90393-X 
Copyright © 1994 Published by Elsevier Science B.V.
The generating polynomial and Euler characteristic of intersection graphs
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Yeong-Nan Yeh
Received 4 August 1992.
Abstract
Let En be n-dimensional Euclidean space. A molecular space is a family of unit cubes in En. Any molecular space can be represented by its intersection graph. Conversely, it is known that any graph G can be represented by molecular space M(G) in En for some n. Suppose that S1 and S2 are topologically equivalent surfaces in En and molecular spaces M1 and M2 are the two families of unit cubes intersecting S1 and S2, respectively. It was revealed that M1 and M2 could be transferred from one to the other with four kinds of contractible transformations if a division was small enough.
In this paper, we will introduce the generating polynomial EG(x) and the Euler characteristic e(G) of a graph G. We will study several various operations performing on two graphs (surfaces). The generating polynomial of the new graph, which is obtained by performing various operations on well-studied graphs, can be expressed in terms of those of the old graphs. An immediate consequence is that the four contractible transformations do not change the Euler characteristic of a graph. Furthermore, we prove that all chordal graphs are contractible.
Author Keywords: Intersection graph; Molecular spaces; Contractible transformations; Generating polynomial; Euler characteristic
