Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Spectrum Problem for 3 of the Cubic Graphs of Order 10

Peter Adams1, Chudan Chan2, Saad I. El-Zanati3, Emma Holdaway4, Ugur Odabasi5, Jackson Ward3
1The University of Queensland, QLD 4072, Australia
2Illinois Wesleyan University, Bloomington, IL 61701, USA
3Illinois State University, Normal, IL 61790-4520, USA
4Brigham Young University, Provo, UT 84602, USA
5Istanbul University, Istanbul 34320, Turkey
  • Published: 30/09/2019

Abstract

There are 19 connected cubic graphs of order 10. If \(G\) is one of a specific set 3 the 19 graphs. we find necessary and sufficient conditions for the existence of \(G\)-decompositions of \(K_v\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Peter Adams, Chudan Chan, Saad I. El-Zanati, Emma Holdaway, Ugur Odabasi, Jackson Ward. The Spectrum Problem for 3 of the Cubic Graphs of Order 10[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 110. -. DOI: .