Article contents
Certain 3-decompositions of complete graphs, with an application to finite fields
Published online by Cambridge University Press: 14 November 2011
Synopsis
A necessary condition is obtained for a complete graph to have a decomposition as the line-disjoint union of three isomorphic strongly regular subgraphs. The condition is used to determine the number of non-trivial solutions of the equation x3+y3 = z3 in a finite field of characteristic p ≡ 2 mod 3.
- Type
- Research Article
- Information
- Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 99 , Issue 3-4 , 1985 , pp. 277 - 281
- Copyright
- Copyright © Royal Society of Edinburgh 1985
References
- 4
- Cited by