0 Item

Graph Theory and Interconnection Networks - Cheng-Kuan Lin

Instant online reading.
Don't wait for delivery!
Go digital and save!

Graph Theory and Interconnection Networks

Name: Graph Theory and Interconnection Networks
Brand: Taylor & Francis Inc
Price: 323.5 AUD
Availability: BackOrder

By: Cheng-Kuan Lin, Lih-Hsing Hsu

Write A Review

Hardcover | 26 September 2008 | Edition Number 1

At a Glance

Hardcover
720 Pages

Dimensions(cm)
24.2 x 16.6 x 4.3

Hardcover

RRP $389.00

$323.50

17%OFF

or 4 interest-free payments of $80.88 with

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to graph terminology, this book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Systems Analysis & Design Mathematics Combinatorics & Graph Theory Applied Mathematics Engineering & Technology Electronics & Communications Engineering Communications Engineering & Telecommunications Discrete Mathematics Information Technology General Issue

Environmental Science

Preface	p. xi
Authors	p. xiii
Fundamental Concepts	p. 1
Graphs and Simple Graphs	p. 1
Matrices and Isomorphisms	p. 5
Paths and Cycles	p. 9
Vertex Degrees	p. 12
Graph Operations	p. 14
Some Basic Techniques	p. 16
Degree Sequences	p. 18
Applications on Graph Isomorphisms	p. 21
Generalized Honeycomb Tori	p. 21
Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks	p. 24
1-Edge Fault-Tolerant Design for Meshes	p. 26
Faithful 1-Edge Fault-Tolerant Graphs	p. 31
k-Edge Fault-Tolerant Designs for Hypercubes	p. 40
Distance and Diameter	p. 43
Introduction	p. 43
Diameter for Some Interconnection Networks	p. 43
Shuffle-Cubes	p. 47
Route 1(u, v)	p. 49
Moore Bound	p. 50
Star Graphs and Pancake Graphs	p. 52
Edge Congestion and Bisection Width	p. 55
Transmitting Problem	p. 57
Trees	p. 61
Basic Properties	p. 61
Breadth-First Search and Depth-First Search	p. 64
Rooted Trees	p. 65
Counting Trees	p. 68
Counting Binary Trees	p. 72
Number of Spanning Trees Contains a Certain Edge	p. 73
Embedding Problem	p. 76
Eulerian Graphs and Digraphs	p. 79
Eulerian Graphs	p. 79
Eulerian Digraphs	p. 82
Applications	p. 85
Chinese Postman Problem	p. 85
Street-Sweeping Problem	p. 86
Drum Design Problem	p. 86
Functional Cell Layout Problem	p. 87
Matchings and Factors	p. 93
Matchings	p. 93
Bipartite Matching	p. 95
Edge Cover	p. 98
Perfect Matching	p. 100
Factors	p. 103
Connectivity	p. 105
Cut and Connectivity	p. 105
2-Connected Graphs	p. 109
Menger Theorem	p. 111
An Application-Making a Road System One-Way	p. 115
Connectivity of Some Interconnection Networks	p. 117
Wide Diameters and Fault Diameters	p. 118
Superconnectivity and Super-Edge-Connectivity	p. 120
Graph Coloring	p. 125
Vertex Colorings and Bounds	p. 125
Properties of k-Critical Graphs	p. 126
Bound for Chromatic Numbers	p. 128
Girth and Chromatic Number	p. 130
Hajos' Conjecture	p. 131
Enumerative Aspects	p. 133
Homomorphism Functions	p. 136
An Application-Testing on Printed Circuit Boards	p. 137
Edge-Colorings	p. 138
Hamiltonian Cycles	p. 141
Hamiltonian Graphs	p. 141
Necessary Conditions	p. 141
Sufficient Conditions	p. 143
Hamiltonian-Connected	p. 147
Mutually Independent Hamiltonian Paths	p. 152
Diameter for Generalized Shuffle-Cubes	p. 155
Cycles in Directed Graphs	p. 158
Planar Graphs	p. 161
Planar Embeddings	p. 161
Euler's Formula	p. 165
Characterization of Planar Graphs	p. 166
Coloring of Planar Graphs	p. 167
Optimal k-Fault-Tolerant Hamiltonian Graphs	p. 171
Introduction	p. 171
Node Expansion	p. 173
Other Construction Methods	p. 180
Fault-Tolerant Hamiltonicity and Fault-Tolerant Hamiltonian Connectivity of the Folded Petersen Cube Networks	p. 185
Fault-Tolerant Hamiltonicity and Fault-Tolerant Hamiltonian Connectivity of the Pancake Graphs	p. 189
Fault-Tolerant Hamiltonicity and Fault-Tolerant Hamiltonian Connectivity of Augmented Cubes	p. 195
Fault-Tolerant Hamiltonicity and Fault-Tolerant Hamiltonian Connectivity of the WK-Recursive Networks	p. 206
Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks	p. 221
Optimal 1-Fault-Tolerant Hamiltonian Graphs	p. 227
Introduction	p. 227
3-Join	p. 228
Cycle Extension	p. 229
Cells for Optimal 1-Hamiltonian Regular Graphs	p. 241
Generalized Petersen Graphs	p. 249
Honeycomb Rectangular Disks	p. 259
Properties with Respect to the 3-Join	p. 262
Examples of Various Cubic Planar Hamiltonian Graphs	p. 267
A [intersection of] B [intersection of] C	p. 268
A [intersection of] B [intersection of] C	p. 268
A [intersection of] B [intersection of] C	p. 268
A [intersection of] B [intersection of] C	p. 269
A [intersection of] B [intersection of] C	p. 271
A [intersection of] B [intersection of] C	p. 272
A [intersection of] B [intersection of] C	p. 273
A [intersection of] B [intersection of] C	p. 274
Hamiltonian Properties of Double Loop Networks	p. 275
Optimal k-Fault-Tolerant Hamiltonian-Laceable Graphs	p. 285
Introduction	p. 285
Super Fault-Tolerant Hamiltonian Laceability of Hypercubes	p. 287
Super Fault-Tolerant Hamiltonian Laceability of Star Graphs	p. 289
Construction Schemes	p. 294
Cubic Hamiltonian-Laceable Graphs	p. 301
l[superscript p]-Fault-Tolerant Hamiltonian Graphs	p. 303
Spider-Web Networks	p. 303
Brother Trees	p. 312
Hamiltonian Laceability of Faulty Hypercubes	p. 318
Conditional Fault Hamiltonicity and Conditional Fault Hamiltonian Laceability of the Star Graphs	p. 327
Spanning Connectivity	p. 339
Introduction	p. 339
Spanning Connectivity of General Graphs	p. 339
Spanning Connectivity and Spanning Laceability of the Hypercube-Like Networks	p. 347
Spanning Connectivity of Crossed Cubes	p. 361
Spanning Connectivity and Spanning Laceability of the Enhanced Hypercube Networks	p. 374
Spanning Connectivity of the Pancake Graphs	p. 391
Spanning Laceability of the Star Graphs	p. 404
Spanning Fan-Connectivity and Spanning Pipe-Connectivity of Graphs	p. 410
Cubic 3-Connected Graphs and Cubic 3-Laceable Graphs	p. 417
Properties of Cubic 3*-Connected Graphs	p. 417
Examples of Cubic Super 3*-Connected Graphs	p. 419
Counterexamples of 3*-Connected Graphs	p. 426
Properties of Cubic 3*-Laceable Graphs	p. 430
Examples of Cubic Hyper 3*-Laceable Graphs	p. 431
Counterexamples of 3*-Laceable Graphs	p. 447
Spanning Diameter	p. 449
Introduction	p. 449
Spanning Diameter for the Star Graphs	p. 449
Spanning Diameter of Hypercubes	p. 465
Spanning Diameter for Some (n, k)-Star Graphs	p. 474
Pancyclic and Panconnected Property	p. 479
Introduction	p. 479
Bipanconnected and Bipancyclic Properties of Hypercubes	p. 480
Edge Fault-Tolerant Bipancyclic Properties of Hypercubes	p. 485
Panconnected and Pancyclic Properties of Augmented Cubes	p. 489
Comparison between Panconnected and Panpositionable Hamiltonian	p. 500
Bipanpositionable Bipancyclic Property of Hypercube	p. 504
Mutually Independent Hamiltonian Cycles	p. 509
Introduction	p. 509
Mutually Independent Hamiltonian Cycles on Some Graphs	p. 510
Mutually Independent Hamiltonian Cycles of Hypercubes	p. 512
Mutually Independent Hamiltonian Cycles of Pancake Graphs	p. 518
Mutually Independent Hamiltonian Cycles of Star Graphs	p. 524
Fault-Free Mutually Independent Hamiltonian Cycles in a Faulty Hypercube	p. 526
Fault-Free Mutually Independent Hamiltonian Cycles in Faulty Star Graphs	p. 530
Orthogonality for Sets of Mutually Independent Hamiltonian Cycles	p. 543
Mutually Independent Hamiltonian Paths	p. 545
Introduction	p. 545
Mutually Independent Hamiltonian Laceability for Hypercubes	p. 545
Mutually Independent Hamiltonian Laceability for Star Graphs	p. 550
Mutually Independent Hamiltonian Connectivity for (n, k)-Star Graphs	p. 555
Cubic 2-Independent Hamiltonian-Connected Graphs	p. 575
Examples of Cubic 2-Independent Hamiltonian-Connected Graphs That Are Super 3*-Connected	p. 576
Examples of Super 3*-Connected Graphs That Are Not Cubic 2-Independent Hamiltonian-Connected	p. 579
Example of a Cubic 2-Independent Hamiltonian-Connected Graph That Is Not Super 3*-Connected	p. 580
Example of a Cubic 1-Fault-Tolerant Hamiltonian Graph That Is Hamiltonian-Connected but Not Cubic 2-Independent Hamiltonian-Connected or Super 3*-Connected	p. 581
Topological Properties of Butterfly Graphs	p. 585
Introduction	p. 585
Cycle Embedding in Faulty Butterfly Graphs	p. 590
Spanning Connectivity for Butterfly Graphs	p. 607
Mutually Independent Hamiltonicity for Butterfly Graphs	p. 616
Diagnosis of Multiprocessor Systems	p. 625
Introduction	p. 625
Diagnosis Models	p. 625
PMC Model	p. 626
Comparison Model	p. 628
Diagnosability of the Matching Composition Networks	p. 631
Diagnosability of the Matching Composition Networks under the PMC Model	p. 632
Diagnosability of the Matching Composition Networks under the Comparison Model	p. 632
Diagnosability of Cartesian Product Networks	p. 637
Diagnosability of Cartesian Product Networks under the PMC Model	p. 638
Diagnosability of Cartesian Product Networks under the Comparison Model	p. 639
Diagnosability of t-Connected Networks	p. 639
Diagnosability of Homogeneous Product Networks	p. 641
Diagnosability of Heterogeneous Product Networks	p. 644
Strongly t-Diagnosable Systems	p. 645
Strongly t-Diagnosable Systems in the Matching Composition Networks	p. 649
Conditional Diagnosability	p. 652
Conditional Diagnosability of Q[subscript n] under the PMC Model	p. 653
Conditional Diagnosability of Q[subscript n] under the Comparison Model	p. 658
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model	p. 666
Cayley Graphs Generated by Transposition Trees	p. 666
Conditional Diagnosability	p. 668
Local Diagnosability	p. 670
Strongly Local-Diagnosable Property	p. 675
Conditional Fault Local Diagnosability	p. 679
References	p. 687
Index	p. 703
Table of Contents provided by Ingram. All Rights Reserved.

Graph Theory and Interconnection Networks

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

Set Theory

An Introduction to Axiomatic Reasoning

Discrete Mathematics for Computing

Grassroots

Cataland

Why the Fuss?

Foundations of Matroids, Part 1

Matroids without Large Uniform Minors

Hamiltonicity of Random Subgraphs of the Hypercube

Discrete Mathematics and Its Applications

2025 Release ISE

Marxian Economics

A New Japanese Tradition

Statistical Modeling and Robust Inference for One-shot Devices

Oriented Matroids

Cambridge Studies in Advanced Mathematics

Primal Heuristics in Integer Programming

Primal Heuristics in Integer Programming

Introduction to Modern Cryptography

Fourth Edition

Modern Computational Methods for Fractional Differential Equations

What Every Engineer Should Know About Computational Techniques of Finite Element Analysis

What Every Engineer Should Know About Computational Techniques of Finite Element Analysis

Non-Newtonian Sequence Spaces with Applications

Chapman & Hall/CRC Monographs and Research Notes in Mathematics

Abstract Chiral Polytopes

New Mathematical Monographs

The Role of Blockchain in Disaster Management

Hybrid Computational Intelligence for Pattern Analysis and Understanding

Discrete and Computational Geometry, 2nd Edition

An Introduction to Discrete Mathematics

Fractional Modelling of Fluid Flow and Transport Phenomena

Advances in Nonlinear Dynamical Systems and Robotics (ANDC)

Math for Programming

Synthetic Media, Deep Fakes, and Cyber Deception

Attacks, Analysis, and Defenses

Open Problems in Algebraic Combinatorics

This product is categorised by