# Shenggui Zhang

According to our database

Collaborative distances:

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

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

On graph entropy measures based on the number of independent sets and matchings.

Inf. Sci., 2020

2019

Six-flows on almost balanced signed graphs.

Journal of Graph Theory, 2019

Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs.

Graphs and Combinatorics, 2019

Fractional chromatic numbers of tensor products of three graphs.

Discret. Math., 2019

On sufficient conditions for rainbow cycles in edge-colored graphs.

Discret. Math., 2019

Properly colored $C_{4}$'s in edge-colored graphs.

CoRR, 2019

A new proof on the Ramsey number of matchings.

CoRR, 2019

Graph entropy based on the number of spanning forests of

*c*-cyclic graphs.
Appl. Math. Comput., 2019

2018

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

Journal of Graph Theory, 2018

Families of vector spaces with r-wise L-intersections.

Discret. Math., 2018

Conditions for graphs to be path partition optimal.

Discret. Math., 2018

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

Discret. Math., 2018

Kernels by properly colored paths in arc-colored digraphs.

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

Cycle extension in edge-colored complete graphs.

Discret. Math., 2017

The von Neumann entropy of random multipartite graphs.

Discret. Appl. Math., 2017

2016

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

Graphs and Combinatorics, 2016

Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs.

Graphs and Combinatorics, 2016

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

Graphs and Combinatorics, 2016

Rainbow cliques in edge-colored graphs.

Eur. J. Comb., 2016

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

Eur. J. Comb., 2016

Heavy subgraph conditions for longest cycles to be heavy in graphs.

Discussiones Mathematicae Graph Theory, 2016

Forbidden subgraphs for hamiltonicity of 1-tough graphs.

Discussiones Mathematicae Graph Theory, 2016

2015

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

Inf. Process. Lett., 2015

Characterizing Heavy Subgraph Pairs for Pancyclicity.

Graphs and Combinatorics, 2015

A note on the number of spanning trees of line digraphs.

Discret. Math., 2015

Forbidden subgraphs for longest cycles to contain vertices with large degrees.

Discret. Math., 2015

2014

Rainbow triangles in edge-colored graphs.

Eur. J. Comb., 2014

Heavy subgraph pairs for traceability of block-chains.

Discussiones Mathematicae Graph Theory, 2014

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

Discrete Math., Alg. and Appl., 2014

2013

Forbidden subgraph pairs for traceability of block-chains.

EJGTA, 2013

Covering digraphs with small indegrees or outdegrees by directed cuts.

Discret. Math., 2013

Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs.

Discret. Math., 2013

2012

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

IEEE Trans. Reliability, 2012

Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs.

SIAM J. Discrete Math., 2012

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

Graphs and Combinatorics, 2012

Pairs of forbidden induced subgraphs for homogeneously traceable graphs.

Discret. Math., 2012

Star subdivisions and connected even factors in the square of a graph.

Discret. Math., 2012

Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts.

Discret. Math., 2012

Further results on the eccentric distance sum.

Discret. Appl. Math., 2012

On the reciprocal degree distance of graphs.

Discret. Appl. Math., 2012

Notes on heavy cycles in weighted digraphs.

Appl. Math. Lett., 2012

2011

Graphs with given number of cut vertices and extremal Merrifield-Simmons index.

Discret. Appl. Math., 2011

Heavy cycles and spanning trees with few leaves in weighted graphs.

Appl. Math. Lett., 2011

An Improved Graph Entropy-based Method for Identifying Protein Complexes.

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

2010

Vertex-disjoint chorded cycles in a graph.

Oper. Res. Lett., 2010

On extremal weighted digraphs with no heavy paths.

Discret. Math., 2010

Extremal graphs with given order and the rupture degree.

Comput. Math. Appl., 2010

Integrated importance measures of multi-state systems under uncertainty.

Comput. Ind. Eng., 2010

Computing the Scattering Number of Bicyclic Graphs.

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

2009

Degree sum conditions for oriented forests in digraphs.

Discret. Math., 2009

Extreme values of the sum of squares of degrees of bipartite graphs.

Discret. Math., 2009

Hamilton cycles in claw-heavy graphs.

Discret. Math., 2009

2008

Vertex-neighbour-integrity of composition graphs of paths and cycles.

Int. J. Comput. Math., 2008

Vulnerability parameters of split graphs.

Int. J. Comput. Math., 2008

Heavy cycles in k-connected weighted graphs with large weighted degree sums.

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

The upper bound of the number of cycles in a 2-factor of a line graph.

Journal of Graph Theory, 2007

Algorithms for symmetric groups of simplexes.

Appl. Math. Comput., 2007

Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums.

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

Some New Structural Properties of Shortest 2-Connected Steiner Networks.

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

2006

Edge vulnerability parameters of split graphs.

Appl. Math. Lett., 2006

An implicit degree condition for long cycles in 2-connected graphs.

Appl. Math. Lett., 2006

2005

Heavy cycles passing through some specified vertices in weighted graphs.

Journal of Graph Theory, 2005

Rupture degree of graphs.

Int. J. Comput. Math., 2005

Paths and cycles in colored graphs.

Australasian J. Combinatorics, 2005

The Binding Number of a Digraph.

Proceedings of the Discrete Geometry, 2005

An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs.

Proceedings of the Discrete Geometry, 2005

2004

Relationships between scattering number and other vulnerability parameters.

Int. J. Comput. Math., 2004

Heavy cycles in k-connected weighted graphs.

Electron. Notes Discret. Math., 2004

On the minimum real roots of the -polynomials and chromatic uniqueness of graphs.

Discret. Math., 2004

Families of integral trees with diameters 4, 6, and 8.

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

Computing the Scattering Number of Graphs.

Int. J. Comput. Math., 2002

A Fan Type Condition For Heavy Cycles in Weighted Graphs.

Graphs and Combinatorics, 2002

2001

Scattering number in graphs.

Networks, 2001

A Co-Marginalistic Contribution Value for Set Games.

IGTR, 2001

Some New Families of Integral Trees with Diameters 4 and 6.

Electron. Notes Discret. Math., 2001

Paths and Cycles in Colored Graphs.

Electron. Notes Discret. Math., 2001

A

*σ*type condition for heavy cycles in weighted graphs._{3}
Discussiones Mathematicae Graph Theory, 2001

2000

Heavy paths and cycles in weighted graphs.

Discret. Math., 2000