Zobrazeno 1 - 10
of 185
pro vyhledávání: '"Wu Tingzeng"'
Autor:
Wu Tingzeng, Zeng Xiaolin
Publikováno v:
Open Mathematics, Vol 22, Iss 1, Pp 1209-1225 (2024)
Counting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximati
Externí odkaz:
https://doaj.org/article/9afedefa8ce2407ab7a5c6dfec0659e4
Autor:
Wu Tingzeng, Lü Huazhong
Publikováno v:
Open Mathematics, Vol 17, Iss 1, Pp 668-676 (2019)
Let G be a connected graph and u and v two vertices of G. The hyper-Wiener index of graph G is WW(G)=12∑u,v∈V(G)(dG(u,v)+dG2(u,v))$\begin{array}{} WW(G)=\frac{1}{2}\sum\limits_{u,v\in V(G)}(d_{G}(u,v)+d^{2}_{G}(u,v)) \end{array}$, where dG(u, v)
Externí odkaz:
https://doaj.org/article/afe6888f08fe46f292361fe2373a5fa6
In this paper, we first introduce a weighted derivation on algebras over an operad $\cal P$, and prove that for the free $\cal P$-algebra, its weighted derivation is determined by the restriction on the generators. As applications, we propose the con
Externí odkaz:
http://arxiv.org/abs/2406.12871
We give an affirmative answer to the open question posed in [34]: are the operated Lie polynomial identities corresponding to new operators on associative algebras in [7] Grobner-Shirshov, respectively?
Comment: 18 pages
Comment: 18 pages
Externí odkaz:
http://arxiv.org/abs/2404.13894
Autor:
Wu Tingzeng, Zhang Heping
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 4, Pp 935-951 (2017)
A graph is said to be characterized by its permanental spectrum if there is no other non-isomorphic graph with the same permanental spectrum. In this paper, we investigate when a complete bipartite graph Kp,p with some edges deleted is determined by
Externí odkaz:
https://doaj.org/article/74ae39793aea4ec8ae98f54fd1a43fec
Autor:
Wu, Tingzeng, Bai, Yinggang
Let $G$ be a graph, and let $A(G)$ be the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $\pi(G,x)=\mathrm{per}(xI-A(G))$. The permanental sum of $G$ can be defined as the sum of absolute value of coefficients of $\pi(G,x)$.
Externí odkaz:
http://arxiv.org/abs/2311.13943
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 3, Pp 505-521 (2016)
Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph. And they pointed out that the chemical applications of matching energy go back to the
Externí odkaz:
https://doaj.org/article/1610dfeacd144dee8c6e0e3d39d0b4f1
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine the number
Externí odkaz:
http://arxiv.org/abs/2306.13279
In the present paper, we propose the concepts of weighted differential ($q$-tri)dendriform algebras and give some basic properties of them. The corresponding free objects are constructed, in both the commutative and noncommutative contexts.
Comm
Comm
Externí odkaz:
http://arxiv.org/abs/2305.19609
Autor:
Ren Shengzhang, Wu Tingzeng
Publikováno v:
Journal of Chemistry, Vol 2016 (2016)
The polyphenyl system is composed of n hexagons obtained from two adjacent hexagons that are sticked by a path with two vertices. The Hosoya index of a graph G is defined as the total number of the independent edge sets of G. In this paper, we give a
Externí odkaz:
https://doaj.org/article/eb14bf697e1b4c3db6dfa4b84c911dea