Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Serviciul de curierat Cargus 28.00 lei Easybox 20.00 lei FAN Courier 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

Eigenspaces of Graphs

Name: Eigenspaces of Graphs
Brand: Cambridge University Press
SKU: 02035761
Price: 873.95 RON
Availability: InStock
Author: Dragos CvetkovicPeter RowlinsonSlobodan Simic
ISBN: 9780521573528

Dragos CvetkovicPeter RowlinsonSlobodan Simic

Limba

engleză

Carte Copertă tare

Codul Libristo: 02035761

Editura Cambridge University Press, ianuarie 1997

Current research on the spectral theory of finite graphs may be seen as part of a wider effort to fo... Descrierea completă

Codul Libristo: 02035761

403 b

873.95 lei

În depozitul extern Expediem în 14-21 zile

Până la 30 de zile pentru returnare

Clienții au cumpărat de asemenea

Amateurrezensionen im Internet Valerie Ponell

Carte broșată

314.50 lei

Supertricks Ole Chamberlain-Andersen

Copertă tare

190.15 lei

Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitrary labelling of graph vertices, using geometrical invariants of eigenspaces such as graph angles and main angles, and introducing certain kinds of canonical eigenvectors by means of star partitions and star bases. One objective is to describe graphs by algebraic means as far as possible, and the book discusses the Ulam reconstruction conjecture and the graph isomorphism problem in this context. Further problems of graph reconstruction and identification are used to illustrate the importance of graph angles and star partitions in relation to graph structure. Specialists in graph theory will welcome this treatment of important new research.