๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Some graphs determined by their spectra
โœ Xiaoling Zhang; Heping Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 225 KB
Which graphs are determined by their spe
โœ Edwin R. van Dam; Willem H. Haemers ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

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.

Computer generation of the characteristi
โœ K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 497 KB

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

The generating polynomial and Euler char
โœ Yeong-Nan Yeh ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 580 KB

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