|Résumé||This will be an elementary introduction to application of eigenvalue methods in graph theory. Only basic knowledge of mathematics will be required.
To make the talk more interesting for researcher we will do a proof of Graham-Pollak theorem. This theorem, which is introduce in relation with having a simple function to determine the distance of given pair of nodes in a large computer network, has only admitted proofs using linear algebra methods. All the attempt on finding a combinatorial proof, though fruitful in some other sense, been unsuccessful. |