Количество точек, движущихся по метрическому графу: зависимость от перестановки ребер
Moving of points on a metric graph associated with the problem of dynamics and statistics of Gaussian packets on a spatial network is under consideration. For an arbitrary tree graph we obtain a representation for the number of points arising from the initial vertex. For a certain graph we find the number of moving points on the graph as the sum of the number of solutions of linear inequalities. We find the first term of the difference of numbers of points moving on two graphs, obtained by permutation of edges. Also we find the leading term for a symmetrical difference of the number of moving points.