On Enumerating Certain Design Problems in Terms of Bicoloured Graphs with No Isolates

F Harary, L March and R W Robinson
Additional contact information
F Harary: Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109, USA
L March: Design Discipline, Faculty of Technology, The Open University, Milton Keynes MK7 6AA, England
R W Robinson: Department of Mathematics, University of Newcastle, New South Wales, Australia, 2308

Environment and Planning B, 1978, vol. 5, issue 1, 31-43

Abstract: The enumeration of zero-one matrices with nonzero row and column sums has recently been solved in the context of certain problems arising in architectural design. However, this solution took no account of the symmetries of these configurations, which would be required for any realistic application in an architectural context. In graph-theoretic terms, this new problem calls for counting unlabelled bicoloured graphs with no isolated points. We determine these numbers by deriving their generating function. We also present an equivalent set of recurrence relations, from which the numbers may be easily computed.

Date: 1978
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b050031 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:5:y:1978:i:1:p:31-43

DOI: 10.1068/b050031

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().