swMATH ID: 3266 Software Authors: Schliep, Alexander Description: The software GADAR and its application to extremal graph theory For the class of algebraically defined graphs – i.e., graphs in which adjacency between vertices is defined by some algebraic relations – existing software packages turned out to be too inefficient. GADAR (short for “Graphs with Algebraically Defined Adjacency Relations”) is a package based on Mathematica. For its design and implementation techniques of object-oriented programming were used. The package is applied to investigation of the infinite families of graphs $${cal D}_{k,q}$$ and $${cal C} D_{k,q}$$ for which some non-intuitive conjectures were obtained. As Lazebnik, Ustimenko and Woldar could prove, the family $${cal C} D_{k,q}$$ is an example of a family of graphs which for given order and girth have the largest size (with a finite number of exceptions). Homepage: http://www.scribd.com/doc/67937444/GADAR Keywords: mathematica Related Software: Mathematica Cited in: 2 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
The software GADAR and its application to extremal graph theory. Zbl 0841.68067
Schliep, Alexander
1994

Cited by 3 Authors

 1 Lazebnik, Felix 1 Schliep, Alexander 1 Viglione, Raymond

Cited in 2 Serials

 1 Discrete Mathematics 1 Congressus Numerantium

Cited in 2 Fields

 2 Combinatorics (05-XX) 1 Computer science (68-XX)