相关论文: Computing the Wiener index in Sierpinski carpet gr…
Some families of graphs, such as the n-cubes and Sierpinski gaskets, are self-similar. In this paper we show how such recursive structure can be used systematically to prove isoperimetric theorems.
On trees of fixed order, we show a direct relation between Kemeny's constant and Wiener index, and provide a new formula of Kemeny's constant from the relation with a combinatorial interpretation. Moreover, the relation simplifies proofs of…
New finite element methods are proposed for elliptic interface problems in one and two dimensions. The main motivation is not only to get an accurate solution but also an accurate first order derivative at the interface (from each side).…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
Recently, D. Vuki$\check{c}$evi$\acute{c}$ and J. Sedlar in \cite{Vuki} introduced an order "$\preceq$" on $\mathcal{T}_n$, the set of trees on $n$ vertices, such that the topological index $F$ of a graph is a function defined on the order…
The eccentric sequence of a connected graph $G$ is the nondecreasing sequence of the eccentricities of its vertices. The Wiener index of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. The unique trees that…
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
In a previous work joint with Dai and Luo, we show that a connected generalized Sierpi\'nski carpet (or shortly a GSC) has cut points if and only if the associated $n$-th Hata graph has a long tail for all $n\geq 2$. In this paper, we…
This is a short introduction to Weingarten Calculus. Weingarten Calculus is a method to compute the joint moments of matrix variables distributed according to the Haar measure of compact groups.
Many nonlinear systems can be described by a Wiener-Schetzen model. In this model, the linear dynamics are formulated in terms of orthonormal basis functions (OBFs). The nonlinearity is modeled by a multivariate polynomial. In general, an…
In this article we present the idea of clique ceiling numbers of the vertices of a given graph that has a universal vertex. We follow up with a polynomial-time algorithm to compute an upper bound for the clique number of such a graph using…
Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…
We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…
A novel and efficient algorithm based on the Wiener chaos expansion is proposed for the stochastic Maxwell equations driven by Wiener process. The proposed algorithm can reduce the original stochastic system to the deterministic case and…
The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…
Certain natural geometric approximation schemes are developed for Wiener measure on a compact Riemannian manifold. These approximations closely mimic the informal path integral formulas used in the physics literature for representing the…
In the present paper, we study Neumaier Cayley graphs. First, we give a criterion for a Cayley graph to be a Neumaier graph with a spread given by the cosets of a subgroup. Further, we construct a new infinite family of Neumaier Cayley…
A method for computing integrals of polynomial functions on compact symmetric spaces is given. Those integrals are expressed as sums of functions on symmetric groups.