Exact positive cubature formulas via generalized sampling on combinatorial graphs

Isaac Pesenson

We consider a disjoint cover (partition) of an undirected weighted finite graph $G$ by $|J|$ connected subgraphs (clusters) $\{S_j{\}}_{j\in J}$ and select a function ${\zeta }_j\ge 0$…