Generalized Connectivity of Graphs
Author:   Xueliang Li ,  Yaping Mao
Publisher:   Springer International Publishing AG
Edition:   1st ed. 2016
ISBN:  

9783319338279


Pages:   143
Publication Date:   11 July 2016
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $145.17 Quantity:  
Add to Cart

Share |

Generalized Connectivity of Graphs


Add your own review!

Overview

Full Product Details

Author:   Xueliang Li ,  Yaping Mao
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2016
Dimensions:   Width: 15.50cm , Height: 0.90cm , Length: 23.50cm
Weight:   2.751kg
ISBN:  

9783319338279


ISBN 10:   3319338277
Pages:   143
Publication Date:   11 July 2016
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

1. Introduction.- 2. Results for some graph classes.- 3. Algorithm and complexity.- 4. Sharp bounds of the generalized (edge-) connectivity.- 5. Graphs with given generalized connectivity.- 6. Nordhaus-Gaddum-type results.- 7. Results for graph products.- 8. Maximum generalized local connectivity.- 9. Generalized connectivity for random graphs.- Bibliography.– Index. 

Reviews

This book is a concise and elegant piece of work on an old yet new topic of combinatorics. ... The book may be of interest for those who work with communication networks, graph theory and combinatorial optimizations in general. (Yilun Shang, zbMATH 1346.05001, 2016)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now