Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Graphs and Discovery
 
Edited by: Siemion Fajtlowicz :  University of Houston, Houston, TX
Patrick W. Fowler :  University of Sheffield, Sheffield, UK
Pierre Hansen :  HEC Montréal, Montréal, Quebec, Canada
Melvin F. Janowitz :  Rutgers University, Piscataway, NJ
Fred S. Roberts :  Rutgers University, Piscataway, NJ
A co-publication of the AMS and DIMACS
Graphs and Discovery
Hardcover ISBN:  978-0-8218-3761-0
Product Code:  DIMACS/69
List Price: $141.00
MAA Member Price: $126.90
AMS Member Price: $112.80
eBook ISBN:  978-1-4704-4026-8
Product Code:  DIMACS/69.E
List Price: $133.00
MAA Member Price: $119.70
AMS Member Price: $106.40
Hardcover ISBN:  978-0-8218-3761-0
eBook: ISBN:  978-1-4704-4026-8
Product Code:  DIMACS/69.B
List Price: $274.00 $207.50
MAA Member Price: $246.60 $186.75
AMS Member Price: $219.20 $166.00
Add to cart
Graphs and Discovery
Click above image for expanded view
Graphs and Discovery
Edited by: Siemion Fajtlowicz :  University of Houston, Houston, TX
Patrick W. Fowler :  University of Sheffield, Sheffield, UK
Pierre Hansen :  HEC Montréal, Montréal, Quebec, Canada
Melvin F. Janowitz :  Rutgers University, Piscataway, NJ
Fred S. Roberts :  Rutgers University, Piscataway, NJ
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-3761-0
Product Code:  DIMACS/69
List Price: $141.00
MAA Member Price: $126.90
AMS Member Price: $112.80
eBook ISBN:  978-1-4704-4026-8
Product Code:  DIMACS/69.E
List Price: $133.00
MAA Member Price: $119.70
AMS Member Price: $106.40
Hardcover ISBN:  978-0-8218-3761-0
eBook ISBN:  978-1-4704-4026-8
Product Code:  DIMACS/69.B
List Price: $274.00 $207.50
MAA Member Price: $246.60 $186.75
AMS Member Price: $219.20 $166.00
Add to cart
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 69; 2005; 370 pp
    MSC: Primary 68; 05

    This volume presents topics addressed at the working group meeting and workshop on Computer-generated Conjectures from Graph Theoretic and Chemical Databases held at Rutgers University (Piscataway, NJ). The events brought together theoreticians and practitioners working in graph theory and chemistry to share ideas and to set an agenda for future developments in the use of computers for generating scientific conjectures.

    Articles included in the volume were written by developers of some of the most important programs used around the world today. The disciplines represented include theoretical and applied computer science, statistics, discrete and non-discrete mathematics, chemistry, and information science.

    The book is suitable for researchers and students interested in the use of computers in graph theory.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
    Readership

    Graduate students and research mathematicians interested in using computers in graph theory.
  • Table of Contents
     
     
    • Chapters
    • Considerations for future designers of general purpose graph software
    • Discovering optimization algorithms through automated learning
    • Numbers of faces and boundary encodings of patches
    • Graph theoretical results obtained by the support of the expert system “graph”–An extended survey
    • Graffiti.pc: A variant of graffiti
    • Some history of the development of graffiti
    • On some conjectures of Griggs and graffiti
    • On the representation and characterization of fullerene C$_{60}$
    • The structure of fullerene signatures
    • Catalog of all fullerenes with ten or more symmetries
    • How far is, should and could be conjecture-making in graph theory an automated process?
    • What forms do interesting conjectures have in graph theory?
    • Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph
    • Mathematics for the nanocell approach to molecular electronics
    • A software system for matroids
    • A survey of research in automated mathematical conjecture-making
    • Constrained generation of molecular graphs
    • A dynamic programming approach for timing and designing clique algorithms
    • On new didactics of mathematics: Learning graph theory via graffiti
    • Interactive conjecturing with Vega
    • On the $(1,2)$-spectral spread of fullerenes
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 69; 2005; 370 pp
MSC: Primary 68; 05

This volume presents topics addressed at the working group meeting and workshop on Computer-generated Conjectures from Graph Theoretic and Chemical Databases held at Rutgers University (Piscataway, NJ). The events brought together theoreticians and practitioners working in graph theory and chemistry to share ideas and to set an agenda for future developments in the use of computers for generating scientific conjectures.

Articles included in the volume were written by developers of some of the most important programs used around the world today. The disciplines represented include theoretical and applied computer science, statistics, discrete and non-discrete mathematics, chemistry, and information science.

The book is suitable for researchers and students interested in the use of computers in graph theory.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Readership

Graduate students and research mathematicians interested in using computers in graph theory.
  • Chapters
  • Considerations for future designers of general purpose graph software
  • Discovering optimization algorithms through automated learning
  • Numbers of faces and boundary encodings of patches
  • Graph theoretical results obtained by the support of the expert system “graph”–An extended survey
  • Graffiti.pc: A variant of graffiti
  • Some history of the development of graffiti
  • On some conjectures of Griggs and graffiti
  • On the representation and characterization of fullerene C$_{60}$
  • The structure of fullerene signatures
  • Catalog of all fullerenes with ten or more symmetries
  • How far is, should and could be conjecture-making in graph theory an automated process?
  • What forms do interesting conjectures have in graph theory?
  • Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph
  • Mathematics for the nanocell approach to molecular electronics
  • A software system for matroids
  • A survey of research in automated mathematical conjecture-making
  • Constrained generation of molecular graphs
  • A dynamic programming approach for timing and designing clique algorithms
  • On new didactics of mathematics: Learning graph theory via graffiti
  • Interactive conjecturing with Vega
  • On the $(1,2)$-spectral spread of fullerenes
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Powered by MathJax
Please select which format for which you are requesting permissions.