Combinatorial matrix theory is a branch of algebraic graph theory, that studies by and large, the interrelations between linear algebra and graph theory. The investigation on the spectral radius of graphs is an important topic in the theory of graph spectra. Primarily, this book contains a survey (and some recent developments) on the largest eigenvalue of the distance matrix of a graph and its relation to the structure of the graph. In literature, extensive study has been made on Adjacency and Laplacian matrices. The distance matrix of a graph, while not as common as the more familiar adjacency matrix, has nevertheless come up in several different areas, including communication network design and network flow algorithms. We hope that this book will ignite the young minds to carry out a research in this fruitful domain and will fill some conspicuous gaps in the study of distance spectra of graphs.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Somnath Paul received his PhD in Mathematical Sciences from Tezpur University. After serving as an Assistant Professor at NIT Silchar for a semester, he joined Tezpur University. Currently he is working as an Assistant Professor (on contract) at Tezpur University. His research interest lie in the field of Spectral Graph Theory.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Combinatorial matrix theory is a branch of algebraic graph theory, that studies by and large, the interrelations between linear algebra and graph theory. The investigation on the spectral radius of graphs is an important topic in the theory of graph spectra. Primarily, this book contains a survey (and some recent developments) on the largest eigenvalue of the distance matrix of a graph and its relation to the structure of the graph. In literature, extensive study has been made on Adjacency and Laplacian matrices. The distance matrix of a graph, while not as common as the more familiar adjacency matrix, has nevertheless come up in several different areas, including communication network design and network flow algorithms. We hope that this book will ignite the young minds to carry out a research in this fruitful domain and will fill some conspicuous gaps in the study of distance spectra of graphs. 72 pp. Englisch. N° de réf. du vendeur 9783330059580
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 72 pages. 8.66x5.91x0.17 inches. In Stock. N° de réf. du vendeur 3330059583
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Paul SomnathSomnath Paul received his PhD in Mathematical Sciences from Tezpur University. After serving as an Assistant Professor at NIT Silchar for a semester, he joined Tezpur University. Currently he is working as an Assistant Pr. N° de réf. du vendeur 151235373
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Combinatorial matrix theory is a branch of algebraic graph theory, that studies by and large, the interrelations between linear algebra and graph theory. The investigation on the spectral radius of graphs is an important topic in the theory of graph spectra. Primarily, this book contains a survey (and some recent developments) on the largest eigenvalue of the distance matrix of a graph and its relation to the structure of the graph. In literature, extensive study has been made on Adjacency and Laplacian matrices. The distance matrix of a graph, while not as common as the more familiar adjacency matrix, has nevertheless come up in several different areas, including communication network design and network flow algorithms. We hope that this book will ignite the young minds to carry out a research in this fruitful domain and will fill some conspicuous gaps in the study of distance spectra of graphs.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch. N° de réf. du vendeur 9783330059580
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Combinatorial matrix theory is a branch of algebraic graph theory, that studies by and large, the interrelations between linear algebra and graph theory. The investigation on the spectral radius of graphs is an important topic in the theory of graph spectra. Primarily, this book contains a survey (and some recent developments) on the largest eigenvalue of the distance matrix of a graph and its relation to the structure of the graph. In literature, extensive study has been made on Adjacency and Laplacian matrices. The distance matrix of a graph, while not as common as the more familiar adjacency matrix, has nevertheless come up in several different areas, including communication network design and network flow algorithms. We hope that this book will ignite the young minds to carry out a research in this fruitful domain and will fill some conspicuous gaps in the study of distance spectra of graphs. N° de réf. du vendeur 9783330059580
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. History and Recent Developments of Distance Spectral Radius | Somnath Paul | Taschenbuch | 72 S. | Englisch | 2017 | LAP LAMBERT Academic Publishing | EAN 9783330059580 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 108794754
Quantité disponible : 5 disponible(s)