Large Cayley graphs on an abelian group (Q1363643): Difference between revisions

The authors discuss bounds on the maximum number of vertices of a Cayley graph with fixed diameter and degree on an abelian group. Brief surveys of known results on lower and upper bounds are followed by a determination of new upper and lower bounds. Various comparisons of these bounds are made.

0 references

zbMATH Keywords

Cayley graph

0 references

diameter

0 references

reviewed by

Steven C. Althoen

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5617548

0 references

An Introduction to the Geometry of Numbers

0 references

Q5622208

0 references

Thin Lattice Coverings

0 references

A Combinatorial Problem Related to Multimodule Memory Organizations

0 references

Application of coding theory to interconnection networks

0 references

Identifiers

zbMATH Open document ID

0880.05047

0 references

DOI

10.1016/S0166-218X(96)00084-4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1363643

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5617548
@@ Property / cites work: Q5617548 / rank @@
+Normal rank
@@ Property / cites work @@
+An Introduction to the Geometry of Numbers
@@ Property / cites work: An Introduction to the Geometry of Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q5622208
@@ Property / cites work: Q5622208 / rank @@
+Normal rank
@@ Property / cites work @@
+Thin Lattice Coverings
@@ Property / cites work: Thin Lattice Coverings / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Problem Related to Multimodule Memory Organizations
+Normal rank
@@ Property / cites work @@
+Application of coding theory to interconnection networks
+Normal rank