Spanning tree results for graphs and multigraphs : a matrix-theoretic approach
Daniel J. Gross, John T. Saccoman, Charles L. Suffel (World Scientific, 2015)
|
| This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning trees. The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.-- |
| No. Panggil : | 511.52 GRO s |
| Entri utama-Nama orang : | |
| Entri tambahan-Nama orang : | |
| Subjek : | |
| Penerbitan : | New Jersey: World Scientific, 2015 |
| Sumber Pengatalogan: | LibUI eng rda |
| ISBN: | 9789814566032 (hbk.) |
| Tipe Konten: | text |
| Tipe Media: | unmediated |
| Tipe Carrier: | volume |
| Edisi: | |
| Catatan Seri: | |
| Catatan Umum: | Includes bibliographical references and index |
| Catatan Versi Asli: | |
| Deskripsi Fisik: | x, 175 pages : illustration ; 24 cm |
| Lembaga Pemilik: | Universitas Indonesia |
| Lokasi: | Perpustakaan UI, Lantai 2 |
| No. Panggil | No. Barkod | Ketersediaan |
|---|---|---|
| 511.52 GRO s | 01-15-06719 | TERSEDIA |
| 511.52 GRO s | 01-17-01656 | TERSEDIA |
| Ulasan: |
| Tidak ada ulasan pada koleksi ini: 20418310 |
