The Spectrum Problem for the Connected Cubic Graphs of Order 10
We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2021-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2220 |
| _version_ | 1797704391021559808 |
|---|---|
| author | Adams Peter El-Zanati Saad I. Odabaşi Uğur Wannasit Wannasiri |
| author_facet | Adams Peter El-Zanati Saad I. Odabaşi Uğur Wannasit Wannasiri |
| author_sort | Adams Peter |
| collection | DOAJ |
| description | We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs. |
| first_indexed | 2024-03-12T05:19:40Z |
| format | Article |
| id | doaj.art-61efcfc497e64f31a4a1f84f88d530b3 |
| institution | Directory Open Access Journal |
| issn | 2083-5892 |
| language | English |
| last_indexed | 2024-03-12T05:19:40Z |
| publishDate | 2021-11-01 |
| publisher | University of Zielona Góra |
| record_format | Article |
| series | Discussiones Mathematicae Graph Theory |
| spelling | doaj.art-61efcfc497e64f31a4a1f84f88d530b32023-09-03T07:47:14ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922021-11-0141496398010.7151/dmgt.2220The Spectrum Problem for the Connected Cubic Graphs of Order 10Adams Peter0El-Zanati Saad I.1Odabaşi Uğur2Wannasit Wannasiri3University of Queensland, QLD 4072, AustraliaIllinois State UniversityNormal, IL 61790-4520 USAIstanbul University, Istanbul, 34320, TurkeyCenter of Excellence in Mathematics and Applied MathematicsChiang Mai University, Chiang Mai 50200, ThailandWe show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.https://doi.org/10.7151/dmgt.2220spectrum problemgraph decompositioncubic graphs05c5105c70 |
| spellingShingle | Adams Peter El-Zanati Saad I. Odabaşi Uğur Wannasit Wannasiri The Spectrum Problem for the Connected Cubic Graphs of Order 10 Discussiones Mathematicae Graph Theory spectrum problem graph decomposition cubic graphs 05c51 05c70 |
| title | The Spectrum Problem for the Connected Cubic Graphs of Order 10 |
| title_full | The Spectrum Problem for the Connected Cubic Graphs of Order 10 |
| title_fullStr | The Spectrum Problem for the Connected Cubic Graphs of Order 10 |
| title_full_unstemmed | The Spectrum Problem for the Connected Cubic Graphs of Order 10 |
| title_short | The Spectrum Problem for the Connected Cubic Graphs of Order 10 |
| title_sort | spectrum problem for the connected cubic graphs of order 10 |
| topic | spectrum problem graph decomposition cubic graphs 05c51 05c70 |
| url | https://doi.org/10.7151/dmgt.2220 |
| work_keys_str_mv | AT adamspeter thespectrumproblemfortheconnectedcubicgraphsoforder10 AT elzanatisaadi thespectrumproblemfortheconnectedcubicgraphsoforder10 AT odabasiugur thespectrumproblemfortheconnectedcubicgraphsoforder10 AT wannasitwannasiri thespectrumproblemfortheconnectedcubicgraphsoforder10 AT adamspeter spectrumproblemfortheconnectedcubicgraphsoforder10 AT elzanatisaadi spectrumproblemfortheconnectedcubicgraphsoforder10 AT odabasiugur spectrumproblemfortheconnectedcubicgraphsoforder10 AT wannasitwannasiri spectrumproblemfortheconnectedcubicgraphsoforder10 |