Graph Theory, Combinatorics, and Algorithms, 2 Volume Set
Edited by: Yousef Alavi; Edited by: A. J. Schwenk
|
|
|
Retail Price: $525.00
Cardiotext Price: $498.75
Availability:
Processing time varies. Price is tentative.
Product Information:
ISBN-13: 9780471304371
ISBN-10: 0471304379
Publisher: Wiley-Interscience
Format: Hardback, 1268 pages
Pub Date: 04/1995
Edition Number: 1
|
|
Synopsis
Partial table of contents: VOLUME 1. Self-Dual Embeddings of the Composition of Bipartite Graphs (M. Abu-Sbeih). The q -Perfect Graphs (C. Berge). On Generalized Location-Domination (D. Carson). On Generalizations of Vertex Connectivity in n -Cube Networks (H.-A. Choi &A. Oh). On the Pure Edge-Integrity of Graphs (K. Bagga &J. Deogun). c -Critical Graphs with Maximum Degree Three (M. Fiol). The Smallest Graph Containing Copies of a Cycle (N. Graham). Survey of Fault Tolerance for Graphs (F. Harary &J. Hayes). On Iterated Line Graphs (E. Jarrett). A Lower Bound for Oblivious Sorting (W. Kirchherr). VOLUME 2. Reduction Towards Collapsibility (H.-J. Lai). On Edge-Balanced Graphs (M. Kong &S.-M. Lee). Connectivity of Double Vertex Graphs (Y. Alavi, et al. ). Embeddings in Tensor Product Graphs (T. Daki ć, et al. ). A Survey of Results on Primal Graphs (J. Preen). Graphs with Few Cliques (E. Prisner). On Group Invariant Flows and Applications (F. Shahrokhi &L. Székely). Sequential Covering Designs (W. Wallis). Domination in the Queen's Graph (W. Weakley). Parsimonious 2-Multigraphs (T. Will &D. West). |
Additional DescriptionPartial table of contents:
VOLUME 1.
Self-Dual Embeddings of the Composition of Bipartite Graphs (M. Abu-Sbeih).
The q -Perfect Graphs (C. Berge).
On Generalized Location-Domination (D. Carson).
On Generalizations of Vertex Connectivity in n -Cube Networks (H.-A.
Choi &A. Oh).
On the Pure Edge-Integrity of Graphs (K. Bagga &J. Deogun).
c -Critical Graphs with Maximum Degree Three (M. Fiol).
The Smallest Graph Containing Copies of a Cycle (N. Graham).
Survey of Fault Tolerance for Graphs (F. Harary &J. Hayes).
On Iterated Line Graphs (E. Jarrett).
A Lower Bound for Oblivious Sorting (W. Kirchherr).
VOLUME 2.
Reduction Towards Collapsibility (H.-J.
Lai).
On Edge-Balanced Graphs (M. Kong &S.-M.
Lee).
Connectivity of Double Vertex Graphs (Y. Alavi, et al. ).
Embeddings in Tensor Product Graphs (T. Daki ć, et al. ).
A Survey of Results on Primal Graphs (J. Preen).
Graphs with Few Cliques (E. Prisner).
On Group Invariant Flows and Applications (F. Shahrokhi &L. Sz kely).
Sequential Covering Designs (W. Wallis).
Domination in the Queen's Graph (W. Weakley).
Parsimonious 2-Multigraphs (T. Will &D. West).
