Spanning Tree Results for Graphs and Multigraphs

A Matrix-Theoretic Approach

Nonfiction, Science & Nature, Mathematics, Graphic Methods
Cover of the book Spanning Tree Results for Graphs and Multigraphs by Daniel J Gross, John T Saccoman, Charles L Suffel, World Scientific Publishing Company
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Daniel J Gross, John T Saccoman, Charles L Suffel ISBN: 9789814566056
Publisher: World Scientific Publishing Company Publication: September 4, 2014
Imprint: WSPC Language: English
Author: Daniel J Gross, John T Saccoman, Charles L Suffel
ISBN: 9789814566056
Publisher: World Scientific Publishing Company
Publication: September 4, 2014
Imprint: WSPC
Language: English

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.

Errata(s)
Errata (46 KB)

Contents:

  • An Introduction to Relevant Graph Theory and Matrix Theory
  • Calculating the Number of Spanning Trees: The Algebraic Approach
  • Multigraphs with the Maximum Number of Spanning Trees: An Analytic Approach
  • Threshold Graphs
  • Approaches to the Multigraph Problem
  • Laplacian Integral Graphs and Multigraphs

Readership: Graduate students and researchers in combinatorics and graph theory.
Key Features:

  • Unlike this book, very few books cover a significant amount of material about the Laplacian matrix, nor do they contain an extensive treatment of counting or optimizing the number of spanning trees
  • Other works in the field do not devote to multigraphs
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

Errata(s)
Errata (46 KB)

Contents:

Readership: Graduate students and researchers in combinatorics and graph theory.
Key Features:

More books from World Scientific Publishing Company

Cover of the book Geometry of Semilinear Embeddings by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Experimental Studies of Neutrino Oscillations by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Memorial Volume for Y. Nambu by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Wars From Within by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book World Scientific Reference on Globalisation in Eurasia and the Pacific Rim by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Climate Change and Energy by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Albert Einstein Memorial Lectures by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Stochastic Drawdowns by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Control of Imperfect Nonlinear Electromechanical Large Scale Systems by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Macroprudential Regulatory Policies by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Zeta Functions of Reductive Groups and Their Zeros by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Positioning Services in Competitive Markets by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Reform and Development in China by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book Inside CERN's Large Hadron Collider by Daniel J Gross, John T Saccoman, Charles L Suffel
Cover of the book China's Maritime Power and Strategy by Daniel J Gross, John T Saccoman, Charles L Suffel
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy