GRAPE
GRAPE is a GAP package for computing with graphs and groups, and is primarily designed for constructing and analysing graphs related to groups, finite geometries, and designs. The vast majority of GRAPE functions are written entirely in the GAP language, except for the automorphism group and isomorphism testing functions, which use Brendan McKay’s nauty package. Computer algebra system (CAS).
Keywords for this software
References in zbMATH (referenced in 82 articles , 1 standard article )
Showing results 1 to 20 of 82.
Sorted by year (- Crnković, Dean; Rukavina, Sanja; Švob, Andrea: On some distance-regular graphs with many vertices (2020)
- Maksimović, Marija: Self-orthogonal codes from row orbit matrices of strongly regular graphs (2019)
- Ahmadidelir, Karim: On the non-commuting graph in finite Moufang loops (2018)
- Maksimović, Marija: Enumeration of strongly regular graphs on up to 50 vertices having (S_3) as an automorphism group (2018)
- Östergård, Patric R. J.; Soicher, Leonard H.: There is no McLaughlin geometry (2018)
- Cameron, Peter J.; Gadouleau, Maximilien; Mitchell, James D.; Peresse, Yann: Chains of subsemigroups (2017)
- Cohen, Nathann; Pasechnik, Dmitrii V.: Implementing Brouwer’s database of strongly regular graphs (2017)
- Klin, Mikhail H.; Woldar, Andrew J.: The strongly regular graph with parameters ((100,22,0,6)): hidden history and beyond (2017)
- Klin, Mikhail; Ziv-Av, Matan: A non-Schurian coherent configuration on 14 points exists (2017)
- Soicher, Leonard H.: The uniqueness of a distance-regular graph with intersection array (32,27,8,1;1,4,27,32) and related results (2017)
- Witzel, Stefan: On panel-regular (\tildeA_2) lattices (2017)
- Abdollahi, Alireza; Janbaz, Shahrooz; Jazaeri, Mojtaba: Groups all of whose undirected Cayley graphs are determined by their spectra (2016)
- Araújo, João; Cameron, Peter J.: Two generalizations of homogeneity in groups with applications to regular semigroups (2016)
- Gyürki, Štefan: Infinite families of directed strongly regular graphs using equitable partitions (2016)
- John Bamberg, Anton Betten, Philippe Cara, Jan De Beule, Max Neunhoeffer, Michel Lavrauw: FinInG: a package for Finite Incidence Geometry (2016) arXiv
- Klin, Mikhail; Kriger, Nimrod; Woldar, Andrew: On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters (2016)
- Linek, Václav; Soicher, Leonard H.; Stevens, Brett: Cube designs (2016)
- Araújo, João; Bentz, Wolfram; Janusz, Konieczny: The commuting graph of the symmetric inverse semigroup (2015)
- Bachoc, Christine; Passuello, Alberto; Thiery, Alain: The density of sets avoiding distance 1 in Euclidean space (2015)
- Bailey, Robert F.: The metric dimension of small distance-regular and strongly regular graphs (2015)