2023/11/20 by Martin Dzúrik, Dzúrik, Martin
Computer Science · Mathematics · #05C12 #05C15 #05C25 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems #Graph theory and applications #Rings and Algebras (math.RA)
paper · pdf · doi:10.48550/arxiv.2311.11682
openalex publication_date 2023/11/20 · openalex created_date 2023/11/23 · openalex updated_date 2026/07/28
In this article we are introducing combinatorial spectra of graphs, this is a generalization of H-Hamiltonian spectra. The main motivation was to made from H-Hamiltonian spectra an operation and develop some algebra in this field. An improved version of this operation form a commutative monoid. The most important thing is that most of the basic concepts of graph theory, such as maximum pairing, vertex and edge connectivity and coloring, Ramsey numbers, isomorphisms and regularity, can be expressed in the language of this operation.