Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach

by John T. Saccoman , Daniel J. Gross , Charles L. Suffel
Save 17% Save 17%
Current price ₹8,753.00
Original price ₹10,504.00
Original price ₹10,504.00
Original price ₹10,504.00
(-17%)
₹8,753.00
Current price ₹8,753.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9789814566032
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: World Scientific Publishing Company
  • Publisher Imprint: World Scientific Publishing Company
  • Publication Date:
  • Pages: 188
  • Original Price: USD 85.0
  • Language: English
  • Edition: N/A
  • Item Weight: 477 grams
  • BISAC Subject(s): Graphic Methods

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us