In [1], Hamzeh, Iranmanesh and Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs. In this paper, we present explicit formulas for this new graph invariant of the Cartesian pr...In [1], Hamzeh, Iranmanesh and Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs. In this paper, we present explicit formulas for this new graph invariant of the Cartesian product, composition, join, disjunction and symmetric difference of graphs and introduce generalized and modified generalized degree distance polynomials of graphs, such that their first derivatives at x = 1 are respectively, equal to the generalized degree distance and the modified generalized degree distance. These polynomials are related to Wiener-type invariant polynomial of graphs.展开更多
Stemming from the definition of the Cauchy principal values (CPV) integrals, a newly developed symmetrical quadrature scheme was proposed in the paper for the accurate numerical evaluation of the singular boundary int...Stemming from the definition of the Cauchy principal values (CPV) integrals, a newly developed symmetrical quadrature scheme was proposed in the paper for the accurate numerical evaluation of the singular boundary integrals in the sense of CPV encountered in the boundary element method. In the case of inner element singularities, the CPV integrals could be evaluated in a straightforward way by dividing the element into the symmetrical part and the remainder(s). And in the case of end singularities, the CPV integrals could be evaluated simply by taking a tangential distance transformation of the integrand after cutting out a symmetrical tiny zone around the singular point. In both cases, the operations are no longer necessary before the numerical implementation, which involves the dull routine work to separate out singularities from the integral kernels. Numerical examples were presented for both the two and the three dimensional boundary integrals in elasticity. Comparing the numerical results with those by other approaches demonstrates the feasibility and the effectiveness of the proposed scheme.展开更多
文摘In [1], Hamzeh, Iranmanesh and Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs. In this paper, we present explicit formulas for this new graph invariant of the Cartesian product, composition, join, disjunction and symmetric difference of graphs and introduce generalized and modified generalized degree distance polynomials of graphs, such that their first derivatives at x = 1 are respectively, equal to the generalized degree distance and the modified generalized degree distance. These polynomials are related to Wiener-type invariant polynomial of graphs.
文摘Stemming from the definition of the Cauchy principal values (CPV) integrals, a newly developed symmetrical quadrature scheme was proposed in the paper for the accurate numerical evaluation of the singular boundary integrals in the sense of CPV encountered in the boundary element method. In the case of inner element singularities, the CPV integrals could be evaluated in a straightforward way by dividing the element into the symmetrical part and the remainder(s). And in the case of end singularities, the CPV integrals could be evaluated simply by taking a tangential distance transformation of the integrand after cutting out a symmetrical tiny zone around the singular point. In both cases, the operations are no longer necessary before the numerical implementation, which involves the dull routine work to separate out singularities from the integral kernels. Numerical examples were presented for both the two and the three dimensional boundary integrals in elasticity. Comparing the numerical results with those by other approaches demonstrates the feasibility and the effectiveness of the proposed scheme.
