Graphs determined by their generalized characteristic polynomials
โ Scribed by Wei Wang; Feng Li; Hongliang Lu; Zongben Xu
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 253 KB
- Volume
- 434
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
For almost all graphs the answer to the question in the title is still unknown. Here we survey the cases for which the answer is known. Not only the adjacency matrix, but also other types of matrices, such as the Laplacian matrix, are considered.
A computer program based on the Frame method for the characteristic polynomials of graphs is developed. This program makes use of an efficient polynomial algorithm of Frame for generating the coefficients in the characteristic polynomials of graphs. This program requires as input only the set of ver
Let E" be n-dimensional Euclidean space. A molecular space is a family of unit cubes in E". 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 E" for some n. Suppose that S, and S, are topologically