The number of determinable parameters and graph colour

The situation becomes radically different when the weights of individual reactions are of the same type, as happens in most cases. Some examples have been given in Sect. 3.1. 

One-type weights of individual reactions lead to the fact that some spanning trees will have the same concentration characteristic (see Sect. 3.3) and these spanning trees will be similar. 

Thus the problem of determining spanning trees with different concentration characteristics reduces to the determination of the number of differently coloured spanning trees. 

A graph of the spanning trees 0(G) of the graph G is called an indirected graph whose nodes correspond to the spanning trees of the graph G in which two points are adjacent if, and only if, their respective spanning trees are coupled. 

Let us present a theorem from ref. 56. If 0(G) has no less than three nodes, then any edge of the graph 0(G) can become a part of the Hamiltonian cycle in 0(G). For our purposes, this property is made concrete in the theorem proved in ref. 57. 

---