Udvidet returret til 31. januar 2017

Du er her:
Laplacian Eigenvectors of Graphs af Turker Biyikoglu, Josef Leydold, Peter F. Stadler

Laplacian Eigenvectors of Graphs (Lecture Notes in Mathematics)

- Perron-Frobenius and Faber-Krahn Type Theorems

(E-bog, PDF)

Beskrivelse: Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose... Læs mere

Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The ... Læs mere

Produktdetaljer:

Sprog:
Engelsk
ISBN-13:
9783540735106
Udgivet:
07-07-2007
Vis mere

Sæt bog på liste

  • Bogliste
kr. 329,95

kr. 219,95

Du tilmelder dig Saxo Plusmedlemskab til 69 kr. hver måned. Se hvordan du sparer tre måneders Plusmedlemskab her

Til dig, der elsker bøger

Læs mere om Plusmedlemskab
Op til 70% rabat Fri fragt
Udvidet returret Ingen binding



OBS!
E-bogen kan ikke læses på Kindle eller i iBooks. Du kan læse e-bogen på computer, tablet, smartphone og diverse e-bogslæsere. Du skal bruge et specielt læseprogram til din enhed. Læs mere om programmer, sidetal og print af e-bøger her.



Forlagets beskrivelse
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrodinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) 'Geometric' properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.The volume investigates the structure of eigenvectors and looks at the number of their sign graphs ('nodal domains'), Perron components, graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology.

Kundernes boganmeldelser af Laplacian Eigenvectors of Graphs (Lecture Notes in Mathematics)


Der er ingen anmeldelser af Laplacian Eigenvectors of Graphs (Lecture Notes in Mathematics)

for at skrive en anmeldelse.

Se andre bøger, der handler om:

Se også: