  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.
