Uniform generalized graphs (Q1386593): Difference between revisions

A weighted (labelled) graph \(G= (V,E)\) with a fixed set of vertices \(\{u_1,u_2,\dots, u_n\}\) is defined to be uniform generalized if for weights \(c_{ij}\) of edges \(u_iu_j\) and weighted degrees \(\text{w}\deg u_i\) of vertices the following holds: \(c_{ij}= c_{pq}\) if \(\text{w}\deg u_i= \text{w}\deg u_p\) and \(\text{w}\deg u_j= \text{w}\deg u_q\) and \(c_{ij}\geq c_{pq}\) if \(\text{w}\deg u_i\geq \text{w}\deg u_p\), \(\text{w}\deg u_j\geq \text{w}\deg u_q\). The paper presents a method of investigation of uniform generalized graphs as ``linear combinations'' of simpler graphs, called extremal, which are completely determined by their weighted degrees.