Tingzeng Wu

Orcid: 0000-0003-2488-9775

According to our database1, Tingzeng Wu authored at least 30 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the Roots of (Signless) Laplacian Permanental Polynomials of Graphs.
Graphs Comb., December, 2023

The second immanantal polynomials of Laplacian matrices of unicyclic graphs.
Appl. Math. Comput., August, 2023

Forcing and anti-forcing polynomials of a type of polyomino graphs.
Comput. Appl. Math., March, 2023

On the (Q-)index of 2-domination critical graphs.
Appl. Math. Comput., 2023

2022
Further results on the star degree of graphs.
Appl. Math. Comput., 2022

2021
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest.
Int. J. Found. Comput. Sci., 2021

Sharp Bounds on the Permanental Sum of a Graph.
Graphs Comb., 2021

Permanental sums of graphs of extreme sizes.
Discret. Math., 2021

On the complexity of structure and substructure connectivity of graphs.
CoRR, 2021

2020
On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes.
Discret. Appl. Math., 2020

On the permanental sum of bicyclic graphs.
Comput. Appl. Math., 2020

2019
Fractional Matching Preclusion for Restricted Hypercube-Like Graphs.
J. Interconnect. Networks, 2019

Edge-disjoint Hamiltonian cycles of balanced hypercubes.
Inf. Process. Lett., 2019

Super edge-connectivity and matching preclusion of data center networks.
Discret. Math. Theor. Comput. Sci., 2019

Unpaired many-to-many disjoint path cover of balanced hypercubes.
CoRR, 2019

The Extremal Permanental Sum for a Quasi-Tree Graph.
Complex., 2019

Unicyclic graphs with second largest and second smallest permanental sums.
Appl. Math. Comput., 2019

2018
Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral.
Graphs Comb., 2018

Structure and substructure connectivity of balanced hypercubes.
CoRR, 2018

On the permanental sum of graphs.
Appl. Math. Comput., 2018

2017
Per-Spectral Characterizations of Bicyclic Networks.
J. Appl. Math., 2017

Extremal Matching Energy of Random Polyomino Chains.
Entropy, 2017

Per-spectral characterizations of some bipartite graphs.
Discuss. Math. Graph Theory, 2017

Computing the permanental polynomials of graphs.
Appl. Math. Comput., 2017

2016
Extremal matching energy of complements of trees.
Discuss. Math. Graph Theory, 2016

Per-spectral and adjacency spectral characterizations of a complete graph removing six edges.
Discret. Appl. Math., 2016

2015
An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.
Graphs Comb., 2015

Some analytical properties of the permanental polynomial of a graph.
Ars Comb., 2015

2010
On the Nullity Algorithm of Tree and Unicyclic Graph.
Proceedings of the Information Computing and Applications - International Conference, 2010

2007
Even Factors with Degree at Most Four in Claw-Free Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007


  Loading...