The spectrum problem for the connected cubic graphs of order 10

DOI10.7151/dmgt.2220zbMath1468.05141OpenAlexW2938071285MaRDI QIDQ2042609

Saad I. El-Zanati, Wannasiri Wannasit, Uğur Odabaşı, Peter J. Adams

Publication date: 21 July 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2220

zbMATH Keywords

cubic graphsspectrum problemgraph decomposition

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Decompositions of complete graphs into circulants
• On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph
• Strongly graceful graphs
• A quick proof that \(K_{10}\neq{}P+P+P\)
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• The Existence and Construction of Balanced Incomplete Block Designs
• A survey on the existence ofG-Designs
• The spectrum problem for the Petersen graph
• The Coarseness of the Complete Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The spectrum problem for the connected cubic graphs of order 10