Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-28T05:57:15.467Z Has data issue: false hasContentIssue false
  • English
  • Français

On k-Cycled Refinements of Certain Graphs

Published online by Cambridge University Press:  20 November 2018

Jehuda Hartman  and
Meir Katchalski
Jehuda Hartman
Affiliation:
University of AlbertaEdmonton, Alberta, Canada
Meir Katchalski
Affiliation:
University of AlbertaEdmonton, Alberta, Canada
Rights & Permissions [Opens in a new window]

Abstract

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.

A graph is k -cycled if all its cycles are integral multiples of an integer k ≥ 2. We determine the structure of refinements of Kn and Kn, m which are k-cycled.

Keywords

05C38
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 26 , Issue 2 , 01 June 1983 , pp. 152 - 156
Copyright
Copyright © Canadian Mathematical Society 1983

References

1. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969.Google Scholar
2. Hartman, J., The homeomorphic embedding of Kn in the m-cube, Discrete Mathematics 16 (1976), 157–160.Google Scholar
3. Turán, P., Eine Extremalaufgabe aus der Graphen Théorie, Mat. Fiz. Lapok. 48 (1941) 436–452.Google Scholar