Triples and hexagons (Q687718)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Triples and hexagons |
scientific article; zbMATH DE number 436559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triples and hexagons |
scientific article; zbMATH DE number 436559 |
Statements
Triples and hexagons (English)
0 references
28 October 1993
0 references
Two classes of cubic graphs are introduced. Their construction is based on the geometry of the projective line. For instance, \(T(p)\), where \(p\) is an odd prime, has as vertices the 3-subsets of \(\text{PG} (1,p)\), where \(\{a,b,c\}\) and \(\{a,b,d\}\) are adjacent when the pairs \(\{a,b\}\) and \(\{c,d\}\) harmonically separate each other. (The definition of \(H(p)\) is a bit more complex.) The graph \(T(p)\) is 2-arc-transitive. For \(p \equiv 1 \pmod 4\) it has two isomorphic connected components, while for \(p \equiv 3 \pmod 4\) it is connected. The girth of \(T(p)\) is greater than \(\log_ \varphi p\), where \(\varphi= {1+\sqrt 5 \over 2}\). The exact value for the girth of \(T(p)\) and \(H(p)\) is computed for several values of \(p\). In some cases they are the smallest known cubic graphs having that girth.
0 references
hexagons
0 references
triples
0 references
cubic graphs
0 references
projective line
0 references
girth
0 references
0.7678953409194946
0 references
0.7666183114051819
0 references
0.7658458948135376
0 references
0.7641107439994812
0 references
0.762796938419342
0 references