Prefer a chat interface with context about you and your work?
On <i>k</i>-Cycled Refinements of Certain Graphs
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 K n and K n, m which are k -cycled.