PERRON-FROBENIUS THEORY AND GRAPH
Perron-Frobenius theory is nonnegative matrices basic theorem that discuss eigenvalue and eigenvector properties from a matrix based on irreducible properties. A graph ???? = (V;E) is a system consists of nite non-empty set V , and set E of unordered pairs fu; vg, u; v 2 V and u 6= v. Eigenvalue...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Subjects: | |
Online Access: | https://digilib.itb.ac.id/gdl/view/33936 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:33936 |
---|---|
spelling |
id-itb.:339362019-01-31T10:34:58ZPERRON-FROBENIUS THEORY AND GRAPH Disha Stanggo, Pratiwi Matematika Indonesia Theses Nonnegative matrices, adjacent matrix, the greatest eigenvalue, Perron-Frobenuis Theory, strongly connected graph and regular graph. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/33936 Perron-Frobenius theory is nonnegative matrices basic theorem that discuss eigenvalue and eigenvector properties from a matrix based on irreducible properties. A graph ???? = (V;E) is a system consists of nite non-empty set V , and set E of unordered pairs fu; vg, u; v 2 V and u 6= v. Eigenvalue of ???? can be determined from adjacency matrices, is matrix with entry (0; 1) that represents vertices adjacency of ????. The purpose of this project is to investigate the properties of the greatest eigenvalue of a graph, specically strongly connected graph that relate with Perron-Frobenius theory, and to investigate the properties of the greatest eigenvalue of regular connected graph. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
topic |
Matematika |
spellingShingle |
Matematika Disha Stanggo, Pratiwi PERRON-FROBENIUS THEORY AND GRAPH |
description |
Perron-Frobenius theory is nonnegative matrices basic theorem that discuss eigenvalue
and eigenvector properties from a matrix based on irreducible properties. A graph ???? =
(V;E) is a system consists of nite non-empty set V , and set E of unordered pairs fu; vg,
u; v 2 V and u 6= v. Eigenvalue of ???? can be determined from adjacency matrices, is matrix
with entry (0; 1) that represents vertices adjacency of ????. The purpose of this project
is to investigate the properties of the greatest eigenvalue of a graph, specically strongly
connected graph that relate with Perron-Frobenius theory, and to investigate the properties
of the greatest eigenvalue of regular connected graph. |
format |
Theses |
author |
Disha Stanggo, Pratiwi |
author_facet |
Disha Stanggo, Pratiwi |
author_sort |
Disha Stanggo, Pratiwi |
title |
PERRON-FROBENIUS THEORY AND GRAPH |
title_short |
PERRON-FROBENIUS THEORY AND GRAPH |
title_full |
PERRON-FROBENIUS THEORY AND GRAPH |
title_fullStr |
PERRON-FROBENIUS THEORY AND GRAPH |
title_full_unstemmed |
PERRON-FROBENIUS THEORY AND GRAPH |
title_sort |
perron-frobenius theory and graph |
url |
https://digilib.itb.ac.id/gdl/view/33936 |
_version_ |
1821996632961449984 |