No CrossRef data available.
Article contents
On k-Cycled Refinements of Certain Graphs
Published online by Cambridge University Press: 20 November 2018
Abstract
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
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1983