9789814566032

Spanning Tree Results for Graphs and Multigraphs

Format: Hardcover

ISBN13: 9789814566032

Hardcover|9789814566032


Overview

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.

ISBN-13

9789814566032

ISBN-10

9814566039

Weight

1.06 Pounds

Dimensions

6.10 x 0.70 x 9.10 In

List Price

$75.00

Edition

1st Edition

Format

Hardcover

Language

English

Pages

188 pages

Publisher

World Scientific Publishing Company

Published On

2014-09-01



View All Offers

Sort by:

Rows per page:

1–5 of 5

Condition
Seller
Seller Comments
Price
Used, Very Good
Seller details
Suffolk Books
★★★★★

center moriches, ny, USA

Fast Shipping-Safe and Secure 7 days a week!
$19.88

 Free delivery by: 02 Apr 2026

Brand New
Seller details
discount_scientific_books
★★★★★

Sterling Heights, MI, USA

New, Satisfaction guaranteed! !
$82.57

 Free delivery by: 02 Apr 2026

Brand New
Seller details
discount_scientific_books
★★★★★

Sterling Heights, MI, USA

New Book Original US edition, We Ship to PO BOX Address also.
$83.21

 Free delivery by: 02 Apr 2026

Brand New
Seller details
Alibris
★★★★★

Sparks, NV, USA

Print on demand Intended for college/higher education audience.
$88.33

 Free delivery by: 02 Apr 2026


Bookstores.com relies on cookies to improve your experience.