Taiwanese Journal of Mathematics, Vol. 13, No. 5 (October 2009), pp. 1397-1410 (14 pages) Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, ...
Graph optimisation problems encompass a diverse range of challenges aimed at finding optimal or near‐optimal solutions in networks or graphs. These problems are pivotal in areas such as communication ...
A real variate is defined for the ordered pairs of nodes in a finite graph. We consider the problem of estimating the total of the variate values from the information provided by a node sample. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback