Hostname: page-component-745bb68f8f-l4dxg Total loading time: 0 Render date: 2025-01-27T17:41:27.424Z Has data issue: false hasContentIssue false
  • English
  • Français

Notes: 61.20 Using graphs to count logic block chains

Published online by Cambridge University Press:  22 September 2016

Derek Ball
Derek Ball*
Affiliation:
College of St Mark and St John, Derriford Road, Plymouth PL6 8BH
Get access Rights & Permissions [Opens in a new window]

Extract

Last summer a colleague of mine suggested a counting problem which I eventually solved by a curious method involving the counting of subgraphs. The problem was to find the number of different ways of arranging twelve Dienes logic blocks which differ only in shape and colour in a closed chain, in such a way that there is one difference in attribute between each pair of neighbouring pieces in the chain.

Type
Research Article
Information
The Mathematical Gazette , Volume 61 , Issue 418 , December 1977 , pp. 288 - 290
Copyright
Copyright © Mathematical Association 1977

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.)