Tingzeng Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Tingzeng Wu has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Huazhong Lü
School of Mathematical Sciences University of Electronic Science and Technology of China 610054 Chengdu Sichuan P.R. China
14 shared publications - Heping Zhang
School of Mathematics and Statistics Lanzhou University Lanzhou China
4 shared publications - Hong-Jian Lai
Guangdong Polytechnic Normal University
4 shared publications Huazhong Lü
4 shared publicationsXiangshuai Dong
School of Mathematics and Statistics, Qinghai Minzu University, Xining, China
4 shared publicationsHong-Jian Lai
3 shared publications
Latest Publications
- 15 October 2026
- Published by Springer Nature in Frontiers of Mathematics
- p. 1-18
Two Open Problems on the Maximum Permanent of Laplacian Matrices of Trees
- 15 October 2026
- Published by Springer Nature in Frontiers of Mathematics
- p. 1-18
Two Open Problems on the Maximum Permanent of Laplacian Matrices of Trees
- 1 September 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 395, 317-336
Counting spanning trees of multipartite graphs and those containing a fixed spanning forest
- 1 September 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 395, 317-336
Counting spanning trees of multipartite graphs and those containing a fixed spanning forest
- 13 August 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (1) , 22
New relations between zeta functions of a graph
- 13 August 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (1) , 22
New relations between zeta functions of a graph
- 11 August 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 532
Brualdi-Goldwasser-Michael problem for maximum permanents of (0,1)-matrices
- 11 August 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 532
Brualdi-Goldwasser-Michael problem for maximum permanents of (0,1)-matrices
- 5 August 2026
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 74 (12) , 1747-1778
Some immanantal inequalities and equalities for linear combination matrices of (di)graphs
1. Let M=(mij) be an n×n matrix. Let Sn be the permutation group on n symbols and χλ be an irreducible character of the symmetric group Sn, indexed by a partition λ of n. The immanant function, dλ ...
- 5 August 2026
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 74 (12) , 1747-1778
Some immanantal inequalities and equalities for linear combination matrices of (di)graphs
1. Let M=(mij) be an n×n matrix. Let Sn be the permutation group on n symbols and χλ be an irreducible character of the symmetric group Sn, indexed by a partition λ of n. The immanant function, dλ ...
- Open Access
The Second Immanantal Polynomial for the Signless Laplacian Matrix of a Graph
The second immanantal polynomial is one of the important directions in algebraic theory. Let be an matrix. The second immanant of matrix M is defined as , where is the irreducible character of the symmetric group of degree n, corresponding to the partition . Let G be a graph with n vertices. Denote by the signless Laplacian matrix of G. The second signless Laplacian immanantal polynomial of G is defined as , where is the coefficient of this polynomial. This paper investigates fundamental properties of this polynomial. First, we give combinatorial expressions for the first few coefficients of the second signless Laplacian immanantal polynomial. Next, we prove that the polynomial has no zero or negative real roots for connected graphs. Furthermore, we show that there is an equivalence relation among three polynomials for regular graphs, which implies that if two regular graphs share the same characteristic polynomial, then they also share the same second signless Laplacian immanantal polynomial. Finally, we prove that paths and almost complete graphs are determined by their second signless Laplacian immanantal polynomials.Open AccessThe Second Immanantal Polynomial for the Signless Laplacian Matrix of a Graph
The second immanantal polynomial is one of the important directions in algebraic theory. Let be an matrix. The second immanant of matrix M is defined as , where is the irreducible character of the symmetric group of degree n, corresponding to the partition . Let G be a graph with n vertices. Denote by the signless Laplacian matrix of G. The second signless Laplacian immanantal polynomial of G is defined as , where is the coefficient of this polynomial. This paper investigates fundamental properties of this polynomial. First, we give combinatorial expressions for the first few coefficients of the second signless Laplacian immanantal polynomial. Next, we prove that the polynomial has no zero or negative real roots for connected graphs. Furthermore, we show that there is an equivalence relation among three polynomials for regular graphs, which implies that if two regular graphs share the same characteristic polynomial, then they also share the same second signless Laplacian immanantal polynomial. Finally, we prove that paths and almost complete graphs are determined by their second signless Laplacian immanantal polynomials. - 5 February 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 211
On complexity of substructure connectivity and restricted connectivity of graphs
- 5 February 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 211
On complexity of substructure connectivity and restricted connectivity of graphs
- Open Access
The number of rooted spanning forests of bicirculant graphs
A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $Γ=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq \mathbb{Z}_n\setminus \{0\}$ and $S\subseteq \mathbb{Z}_n$. In this paper, using Chebyshev polynomials, we obtain a closed formula for the number of rooted spanning forests of $Γ$. Moreover, we investigate some arithmetic properties of the number of rooted spanning forests of $Γ$, and find its asymptotic behaviour as $n$ tends infinity.Open AccessThe number of rooted spanning forests of bicirculant graphs
A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $Γ=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq \mathbb{Z}_n\setminus \{0\}$ and $S\subseteq \mathbb{Z}_n$. In this paper, using Chebyshev polynomials, we obtain a closed formula for the number of rooted spanning forests of $Γ$. Moreover, we investigate some arithmetic properties of the number of rooted spanning forests of $Γ$, and find its asymptotic behaviour as $n$ tends infinity. - 9 December 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 516
On the permanent indices of graphs
- 9 December 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 516
On the permanent indices of graphs
- 1 November 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Some results on total weight choosability
A graph [ ] is called [ ]-choosable if for any total list assignment [ ] which assigns to each vertex [ ] a set [ ] of [ ] real numbers, and assigns to each edge [ ] a set [ ] of [ ] real numbers, there is a mapping [ ] such that [ ] for any [ ] and for any two adjacent vertices [ ], [ ], where [ ] denotes the set of incident edges of a vertex [ ]. An [ ]-graph is a graph with [ ] vertices and [ ] edges. In this paper, we characterize sufficient conditions for [ ]-choosability and demonstrate that connected [ ]-graphs with [ ] or [ ] are both [ ]-choosable and [ ]-choosable. Furthermore, we establish [ ]-choosability for graphs obtained through specific graph operations. Our results contribute to the conjectures proposed by Wong and Zhu regarding total weight choosability.
- 1 November 2025
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Some results on total weight choosability
A graph [ ] is called [ ]-choosable if for any total list assignment [ ] which assigns to each vertex [ ] a set [ ] of [ ] real numbers, and assigns to each edge [ ] a set [ ] of [ ] real numbers, there is a mapping [ ] such that [ ] for any [ ] and for any two adjacent vertices [ ], [ ], where [ ] denotes the set of incident edges of a vertex [ ]. An [ ]-graph is a graph with [ ] vertices and [ ] edges. In this paper, we characterize sufficient conditions for [ ]-choosability and demonstrate that connected [ ]-graphs with [ ] or [ ] are both [ ]-choosable and [ ]-choosable. Furthermore, we establish [ ]-choosability for graphs obtained through specific graph operations. Our results contribute to the conjectures proposed by Wong and Zhu regarding total weight choosability.