Open Research Newcastle
Browse

Strong VMTLs of odd order 2-regular graphs

Download (221.67 kB)
report
posted on 2025-05-13, 11:39 authored by Jason S. Kimberley, James A. MacDougall
Tables of edge cycles proving the theorem: Other than the three graphs, $C_{3} cup C_{4}$, $2C_{3} cup C_{5}$ and $3C_{3} cup C_{4}$, every 2-regular graph of odd order less than 30 has a strong vertex magic total labelling.

History

Publisher

Unpublished

Language

  • en, English

College/Research Centre

Faculty of Science and Information Technology

School

University Library

Usage metrics

    Reports

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC