# Shenggui Zhang

Orcid: 0000-0002-9596-0826
According to our database

Collaborative distances:

^{1}, Shenggui Zhang authored at least 124 papers between 2000 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Generating functions and counting formulas for spanning trees and forests in hypergraphs.

Adv. Appl. Math., April, 2024

J. Graph Theory, January, 2024

Inf. Sci., 2024

Discret. Math., 2024

Discret. Appl. Math., 2024

2023

Discret. Math., December, 2023

Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems.

Appl. Math. Comput., September, 2023

Discret. Math., August, 2023

Graphs Comb., April, 2023

Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs.

J. Comb. Optim., March, 2023

Discret. Math., 2023

Proof of a conjecture on the spectral radius condition for [<i>a</i>, <i>b</i>]-factors.

Discret. Math., 2023

Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs.

Discret. Appl. Math., 2023

Appl. Math. Comput., 2023

2022

On Topology Optimization for Event-Triggered Consensus With Triggered Events Reducing and Convergence Rate Improving.

IEEE Trans. Circuits Syst. II Express Briefs, 2022

Determining Redundant Links of Multiagent Systems in Keeping or Improving Consensus Convergence Rates.

IEEE Syst. J., 2022

Matching Algorithms of Minimum Input Selection for Structural Controllability Based on Semi-Tensor Product of Matrices.

J. Syst. Sci. Complex., 2022

Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs.

Discret. Appl. Math., 2022

Discret. Appl. Math., 2022

2021

Graphs Comb., 2021

Graphs Comb., 2021

Discret. Math., 2021

Discret. Math., 2021

Discret. Appl. Math., 2021

CoRR, 2021

Electron. J. Comb., 2021

Appl. Math. Comput., 2021

Appl. Math. Comput., 2021

2020

J. Graph Theory, 2020

Some algorithmic results for finding compatible spanning circuits in edge-colored graphs.

J. Comb. Optim., 2020

Inf. Sci., 2020

Graphs Comb., 2020

Graphs Comb., 2020

Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs.

Discret. Math., 2020

Discret. Math., 2020

Discret. Math., 2020

Discret. Appl. Math., 2020

Discret. Appl. Math., 2020

Discret. Appl. Math., 2020

Discret. Appl. Math., 2020

Appl. Math. Comput., 2020

2019

J. Graph Theory, 2019

Graphs Comb., 2019

Discret. Math., 2019

Discret. Math., 2019

CoRR, 2019

CoRR, 2019

Appl. Math. Comput., 2019

2018

Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs.

J. Graph Theory, 2018

Discret. Math., 2018

Discret. Math., 2018

Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems.

Discret. Math., 2018

Discret. Math., 2018

Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.

Appl. Math. Comput., 2018

Coulson-type integral formulas for the general energy of polynomials with real roots.

Appl. Math. Comput., 2018

2017

Discret. Math., 2017

Discret. Appl. Math., 2017

2016

Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions.

Graphs Comb., 2016

Graphs Comb., 2016

Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition.

Graphs Comb., 2016

Eur. J. Comb., 2016

Set systems with k-wise L-intersections and codes with restricted Hamming distances.

Eur. J. Comb., 2016

Discuss. Math. Graph Theory, 2016

Discuss. Math. Graph Theory, 2016

2015

On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees.

Inf. Process. Lett., 2015

Graphs Comb., 2015

Discret. Math., 2015

Discret. Math., 2015

2014

Eur. J. Comb., 2014

Discuss. Math. Graph Theory, 2014

Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs.

Discret. Math. Algorithms Appl., 2014

2013

Electron. J. Graph Theory Appl., 2013

Discret. Math., 2013

Discret. Math., 2013

2012

Integrated Importance Measure of Component States Based on Loss of System Performance.

IEEE Trans. Reliab., 2012

SIAM J. Discret. Math., 2012

Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs.

Graphs Comb., 2012

Discret. Math., 2012

Discret. Math., 2012

Discret. Math., 2012

Discret. Appl. Math., 2012

Discret. Appl. Math., 2012

Appl. Math. Lett., 2012

2011

Discret. Appl. Math., 2011

Appl. Math. Lett., 2011

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010

Oper. Res. Lett., 2010

Discret. Math., 2010

Comput. Math. Appl., 2010

Comput. Ind. Eng., 2010

Proceedings of the 2010 International Conference on Computational Intelligence and Security, 2010

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

2008

Int. J. Comput. Math., 2008

Int. J. Comput. Math., 2008

Discret. Math., 2008

Vertex-Neighbor-Integrity of Composition Graphs of Paths.

Ars Comb., 2008

A New s3 Type Condition for Heavy Cycles in Weighted Graphs.

Ars Comb., 2008

2007

J. Graph Theory, 2007

Appl. Math. Comput., 2007

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

2006

Appl. Math. Lett., 2006

Appl. Math. Lett., 2006

2005

J. Graph Theory, 2005

Int. J. Comput. Math., 2005

Australas. J Comb., 2005

Proceedings of the Discrete Geometry, 2005

Proceedings of the Discrete Geometry, 2005

2004

Int. J. Comput. Math., 2004

Electron. Notes Discret. Math., 2004

Discret. Math., 2004

Discret. Appl. Math., 2004

Gröbner basis for an ideal of a polynomial ring over an algebraic extension over a field and its applications.

Appl. Math. Comput., 2004

2002

Int. J. Comput. Math., 2002

Graphs Comb., 2002

2001

Networks, 2001

IGTR, 2001

Electron. Notes Discret. Math., 2001

Electron. Notes Discret. Math., 2001

Discuss. Math. Graph Theory, 2001

2000

Discret. Math., 2000