Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-24T03:02:02.612Z Has data issue: false hasContentIssue false
  • English
  • Français

Certain 3-decompositions of complete graphs, with an application to finite fields

Published online by Cambridge University Press:  14 November 2011

Peter Rowlinson
Peter Rowlinson
Affiliation:
Department of Mathematics, University of Stirling, Stirling FK9 4LA, Scotland
Get access Rights & Permissions [Opens in a new window]

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1Bose, R. C. and Shrikhande, S. S.. Graphs in which each pair of vertices is adjacent to the same number d of other vertices. Studia Sci. Math. Hungar. 5 (1970), 181–195.Google Scholar
2Cameron, P. J. and van Lint, J. H.. Graph Theory, Coding Theory and Block Designs (London Math. Soc. Lecture Note Series No. 19) (Edinburgh: Cambridge University Press, 1975).CrossRefGoogle Scholar
3Hua, L.-K. and Vandiver, H. S.. On the number of solutions of some trinomial equations in a finite field. Proc. Nat. Acad. Sci. U.S.A. 35 (1949), 477–481.CrossRefGoogle Scholar
4Khadzhiivanov, N. G. and Nenov, N. D.. The number of solutions of the Fermat equation xn + yn = zn in a Galois field. C. R. Acad. Bulgare Sci. 32 (1979), 557–560.Google Scholar
5Mesner, D. M.. A new family of partially balanced incomplete block designs with some Latin square design properties. Ann. Math. Stat. 38 (1967), 571–581.Google Scholar
6Seidel, J. J.. Strongly regular graphs with (–1,1,0) adjacency matrix having eigenvalue 3. Linear Algebra Appl. 1 (1968), 281–298.Google Scholar