**DIMACS - Series in Discrete Mathematics and Theoretical Computer Science**

Volume: 69;
2005;
370 pp;
Hardcover

MSC: Primary 68; 05;

Print ISBN: 978-0-8218-3761-0

Product Code: DIMACS/69

List Price: $126.00

Individual Member Price: $100.80

**Electronic ISBN: 978-1-4704-4026-8
Product Code: DIMACS/69.E**

List Price: $126.00

Individual Member Price: $100.80

# Graphs and Discovery

Share this page *Edited by *
*Siemion Fajtlowicz; Patrick W. Fowler; Pierre Hansen; Melvin F. Janowitz; Fred S. Roberts*

A co-publication of the AMS and DIMACS

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).

#### Table of Contents

# Table of Contents

## Graphs and Discovery

- Cover Cover11
- Title page i2
- Contents iii4
- Foreword v6
- Preface vii8
- Considerations for future designers of general purpose graph software 116
- Discovering optimization algorithms through automated learning 722
- Numbers of faces and boundary encodings of patches 2742
- Graph theoretical results obtained by the support of the expert system “graph”–An extended survey 3954
- Graffiti.pc: A variant of graffiti 7186
- Some history of the development of graffiti 8196
- On some conjectures of Griggs and graffiti 119134
- On the representation and characterization of fullerene C₆₀ 127142
- The structure of fullerene signatures 137152
- Catalog of all fullerenes with ten or more symmetries 167182
- How far is, should and could be conjecture-making in graph theory an automated process? 189204
- What forms do interesting conjectures have in graph theory? 231246
- Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph 253268
- Mathematics for the nanocell approach to molecular electronics 265280
- A software system for matroids 287302
- A survey of research in automated mathematical conjecture-making 297312
- Constrained generation of molecular graphs 319334
- A dynamic programming approach for timing and designing clique algorithms 333348
- On new didactics of mathematics: Learning graph theory via graffiti 341356
- Interactive conjecturing with Vega 351366
- On the (1,2)-spectral spread of fullerenes 365380
- Back Cover Back Cover1386

#### Readership

Graduate students and research mathematicians interested in using computers in graph theory.