Authors and affiliations
J. T. A. Christos
PO Box 495, Balgowlah, NSW, 2093, Australia
This paper considers the following problems from graph theory: in any section of given size of a trellis or wire-mesh fence, how many squares are there? how many rectangles are there? how many symmetric crosses are there? how many crosses in general? Certain patterns of arrays of numbers related to various substructures in terms of the numbers of edges and vertices in each case are listed and counted.
- Paul R Halmos. Want to be a Mathematician. New York: Springer-Verlag, 1985.
- Kenneth E. Iverson. “Notation as a Tool of Thought.” Communications of the Association of Computing Machinery 23.8 (1980): 444-465.
- A.G. Shannon, “Fibonacci and Lucas Numbers and the Complexity of a Graph”, The Fibonacci Quarterly 16.1 (1978): 1-4.
Cite this paperAPA
Christos, J., Ollerton, R. & Shannon, A. (2008). Some combinatorial and recurrence relations for shapes in a trellis. Notes on Number Theory and Discrete Mathematics, 14(2), 1-10.Chicago
Christos, JTA, and AG Shannon. “Some Combinatorial and Recurrence Relations for Shapes in a Trellis.” Notes on Number Theory and Discrete Mathematics 14, no. 2 (2008): 1-10.MLA
Christos, JTA, and AG Shannon. “Some Combinatorial and Recurrence Relations for Shapes in a Trellis.” Notes on Number Theory and Discrete Mathematics 14.2 (2008): 1-10. Print.