Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-26T17:45:28.789Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Number of Parity Sets in a Graph

Published online by Cambridge University Press:  20 November 2018

Charles H. C. Little
Charles H. C. Little*
Affiliation:
Royal Melbourne Institute of Technology, Melbourne, Australia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The graphs considered in this paper are finite and have no loops or multiple edges. If G is such a graph, we denote its vertex set by VG and its edge set by EG. If X and Y are disjoint subsets of VG, we define δ (X, Y) to be the set of edges of G that join a vertex in X to one in Y.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 28 , Issue 6 , 01 December 1976 , pp. 1167 - 1171
Copyright
Copyright © Canadian Mathematical Society 1976

References

1. Little, C. H. C., Kasteleyn s theorem and arbitrary graphs, Can. J. Math. 25 (1973), 758–764.Google Scholar
2. Harary, F., Graph theory (Addison-Wesley, Reading, Mass., 1969), p. 39.Google Scholar
3. Kasteleyn, P. W., Graph theory and crystal physics, in Harary, F., éd., Graph theory and theoretical physics (Academic Press, London, 1967), pp. 43–110.Google Scholar