Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
In this note we analyze the linearized equations of forced elongation. We prove that solutions of these equations are given by a quasicontraction C0-semigroup on the physically co...
1 We provide an efficient method to calculate the pseudo-inverse of the Laplacian of a bipartite graph, which is2 based on the pseudo-inverse of the normalized Laplacian.3
A posteriori error estimates are derived for unsteady convection-diffusion equations discretized with the non-symmetric interior penalty and the local discontinuous Galerkin metho...
Some new inequalities for the Cebysev functional in terms of the first derivative and applications for Taylor's expansion and generalised trapezoid formula are pointed out.