Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-16T01:27:33.177Z Has data issue: false hasContentIssue false
  • English
  • Français

Magic Graphs

Published online by Cambridge University Press:  20 November 2018

B. M. Stewart
B. M. Stewart*
Affiliation:
Michigan State University
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.

In this paper we use number-theoretic properties to classify ordinary graphs that are finite and have no isolated vertices. The classification depends on whether there is an assignment of real values, usually rational integer values, to the edges of the graph, such that the set of assigned values and the set of vertex sums of these values, summed at each vertex over all the edges incident to the vertex, will be a pair of sets with prescribed properties. Then we seek corresponding graph-theoretic properties.

It is possible to describe the problem in terms of a symmetric matrix having specified properties for its row sums, but in this paper we make no use of this interpretation; however, see (3).

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 18 , 1966 , pp. 1031 - 1059
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Theory of graphs and its applications. Smolenice Symposium (Prague, 1964), pp. 163-164, Problem 27.Google Scholar
2. Ball, W. W. R., Mathematical Recreations and Essays, 11th ed. (London, 1939), Chap. VII.Google Scholar
3. Stewart, B. M., Super-magic complete graphs (accepted for publication).Google Scholar