Heavy paths and cycles in weighted graphs. - Shenggui Zhang; Xueliang Li 001; Hajo Broersma (Discret. Math., 2000)

A σ3 type condition for heavy cycles in weighted graphs. - Hajo Broersma; Xueliang Li 001; Shenggui Zhang (Discuss. Math. Graph Theory, 2001)

Paths and Cycles in Colored Graphs. - Xueliang Li 001; Shenggui Zhang; Hajo Broersma (Electron. Notes Discret. Math., 2001)

Some New Families of Integral Trees with Diameters 4 and 6. - Ligong Wang 001; Xueliang Li 001; Shenggui Zhang (Electron. Notes Discret. Math., 2001)

A Co-Marginalistic Contribution Value for Set Games. - Hao Sun 011; Shenggui Zhang; Xueliang Li 001; Theo S. H. Driessen; Cornelis Hoede (IGTR, 2001)

Scattering number in graphs. - Shenggui Zhang; Ziguo Wang (Networks, 2001)

A Fan Type Condition For Heavy Cycles in Weighted Graphs. - Shenggui Zhang; Hajo Broersma; Xueliang Li 001; Ligong Wang 001 (Graphs Comb., 2002)

Computing the Scattering Number of Graphs. - Shenggui Zhang; Xueliang Li 001; Xinglou Han (Int. J. Comput. Math., 2002)

Gröbner basis for an ideal of a polynomial ring over an algebraic extension over a field and its applications. - Shenggui Zhang; Sui Sun Cheng (Appl. Math. Comput., 2004)

Families of integral trees with diameters 4, 6, and 8. - Ligong Wang 001; Xueliang Li 001; Shenggui Zhang (Discret. Appl. Math., 2004)

On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. - Haixing Zhao; Xueliang Li 001; Shenggui Zhang; Ruying Liu (Discret. Math., 2004)

Heavy cycles in k-connected weighted graphs. - Shenggui Zhang; Bing Chen 006; Rongzu Yu (Electron. Notes Discret. Math., 2004)

Relationships between scattering number and other vulnerability parameters. - Shenggui Zhang; Shuying Peng (Int. J. Comput. Math., 2004)

An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs. - Bing Chen 006; Shenggui Zhang; T. C. Edwin Cheng (CJCDGCGT, 2005)

The Binding Number of a Digraph. - Genjiu Xu; Xueliang Li 001; Shenggui Zhang (CJCDGCGT, 2005)

Paths and cycles in colored graphs. - Hajo Broersma; Xueliang Li 001; Gerhard J. Woeginger; Shenggui Zhang (Australas. J Comb., 2005)

Rupture degree of graphs. - Yinkui Li; Shenggui Zhang; Xueliang Li 001 (Int. J. Comput. Math., 2005)

Heavy cycles passing through some specified vertices in weighted graphs. - Jun Fujisawa; Kiyoshi Yoshimoto; Shenggui Zhang (J. Graph Theory, 2005)

An implicit degree condition for long cycles in 2-connected graphs. - Bing Chen 006; Shenggui Zhang (Appl. Math. Lett., 2006)

Edge vulnerability parameters of split graphs. - Qilong Zhang; Shenggui Zhang (Appl. Math. Lett., 2006)

Some New Structural Properties of Shortest 2-Connected Steiner Networks. - Shuying Peng; Meili Li; Shenggui Zhang; T. C. Edwin Cheng (FAW, 2007)

Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums. - Bing Chen 006; Shenggui Zhang; T. C. Edwin Cheng (International Conference on Computational Science (3), 2007)

Algorithms for symmetric groups of simplexes. - Shenggui Zhang; Huiling Lin (Appl. Math. Comput., 2007)

The upper bound of the number of cycles in a 2-factor of a line graph. - Jun Fujisawa; Liming Xiong; Kiyoshi Yoshimoto; Shenggui Zhang (J. Graph Theory, 2007)

A New s3 Type Condition for Heavy Cycles in Weighted Graphs. - Bing Chen 006; Shenggui Zhang (Ars Comb., 2008)

Vertex-Neighbor-Integrity of Composition Graphs of Paths. - Zongtian Wei; Shenggui Zhang (Ars Comb., 2008)

Heavy cycles in k-connected weighted graphs with large weighted degree sums. - Bing Chen 006; Shenggui Zhang; T. C. Edwin Cheng (Discret. Math., 2008)

Vulnerability parameters of split graphs. - Yinkui Li; Shenggui Zhang; Qilong Zhang (Int. J. Comput. Math., 2008)

Vertex-neighbour-integrity of composition graphs of paths and cycles. - Zongtian Wei; Shenggui Zhang (Int. J. Comput. Math., 2008)

Hamilton cycles in claw-heavy graphs. - Bing Chen 006; Shenggui Zhang; Shengning Qiao (Discret. Math., 2009)

Extreme values of the sum of squares of degrees of bipartite graphs. - T. C. Edwin Cheng; Yonglin Guo; Shenggui Zhang; Yongjun Du (Discret. Math., 2009)

Degree sum conditions for oriented forests in digraphs. - Shengning Qiao; Shenggui Zhang (Discret. Math., 2009)

Computing the connectivity indices of α- and β-cyclodextrins. - Wu Jiang; Shenggui Zhang (BIBM Workshops, 2010)

Computing the Scattering Number of Bicyclic Graphs. - Bing Chen 006; Shenggui Zhang (CIS, 2010)

Integrated importance measures of multi-state systems under uncertainty. - Shubin Si; Zhiqiang Cai 003; Shudong Sun; Shenggui Zhang (Comput. Ind. Eng., 2010)

Extremal graphs with given order and the rupture degree. - Yinkui Li; Shenggui Zhang (Comput. Math. Appl., 2010)

On extremal weighted digraphs with no heavy paths. - Binlong Li; Shenggui Zhang (Discret. Math., 2010)

Vertex-disjoint chorded cycles in a graph. - Shengning Qiao; Shenggui Zhang (Oper. Res. Lett., 2010)

An Improved Graph Entropy-based Method for Identifying Protein Complexes. - Bolin Chen; Yan Yan 029; Jin-Hong Shi; Shenggui Zhang; Fang-Xiang Wu (BIBM, 2011)

Heavy cycles and spanning trees with few leaves in weighted graphs. - Binlong Li; Shenggui Zhang (Appl. Math. Lett., 2011)

Graphs with given number of cut vertices and extremal Merrifield-Simmons index. - Hongbo Hua; Shenggui Zhang (Discret. Appl. Math., 2011)

Notes on heavy cycles in weighted digraphs. - Binlong Li; Shenggui Zhang (Appl. Math. Lett., 2012)

On the reciprocal degree distance of graphs. - Hongbo Hua; Shenggui Zhang (Discret. Appl. Math., 2012)

Further results on the eccentric distance sum. - Hongbo Hua; Shenggui Zhang; Kexiang Xu (Discret. Appl. Math., 2012)

Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts. - Yandong Bai; Binlong Li; Shenggui Zhang (Discret. Math., 2012)

Star subdivisions and connected even factors in the square of a graph. - Jan Ekstein; Premysl Holub; Tomás Kaiser; Liming Xiong; Shenggui Zhang (Discret. Math., 2012)

Pairs of forbidden induced subgraphs for homogeneously traceable graphs. - Binlong Li; Hajo Broersma; Shenggui Zhang (Discret. Math., 2012)

Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs. - Shengning Qiao; Shenggui Zhang (Graphs Comb., 2012)

Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs. - Binlong Li; Zdenek Ryjácek; Ying Wang; Shenggui Zhang (SIAM J. Discret. Math., 2012)

Integrated Importance Measure of Component States Based on Loss of System Performance. - Shubin Si; Hongyan Dui; Xibin Zhao; Shenggui Zhang; Shudong Sun (IEEE Trans. Reliab., 2012)

Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs. - Bo Ning 001; Shenggui Zhang (Discret. Math., 2013)

Covering digraphs with small indegrees or outdegrees by directed cuts. - Chuandong Xu; Shenggui Zhang; You Lu 002 (Discret. Math., 2013)

Forbidden subgraph pairs for traceability of block-chains. - Binlong Li; Hajo Broersma; Shenggui Zhang (Electron. J. Graph Theory Appl., 2013)

Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs. - Bo Ning 001; Shenggui Zhang; Bing Chen 006 (Discret. Math. Algorithms Appl., 2014)

Heavy subgraph pairs for traceability of block-chains. - Hajo Broersma; Binlong Li; Shenggui Zhang (Discuss. Math. Graph Theory, 2014)

Rainbow triangles in edge-colored graphs. - Binlong Li; Bo Ning 001; Chuandong Xu; Shenggui Zhang (Eur. J. Comb., 2014)

Forbidden subgraphs for longest cycles to contain vertices with large degrees. - Binlong Li; Shenggui Zhang (Discret. Math., 2015)

A note on the number of spanning trees of line digraphs. - Chuandong Xu; Shenggui Zhang; Bo Ning 001; Binlong Li (Discret. Math., 2015)

Characterizing Heavy Subgraph Pairs for Pancyclicity. - Binlong Li; Bo Ning 001; Hajo Broersma; Shenggui Zhang (Graphs Comb., 2015)

On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees. - Chuandong Xu; Shenggui Zhang; Yi Wang (Inf. Process. Lett., 2015)

Forbidden subgraphs for hamiltonicity of 1-tough graphs. - Hajo Broersma; Binlong Li; Shenggui Zhang (Discuss. Math. Graph Theory, 2016)

Heavy subgraph conditions for longest cycles to be heavy in graphs. - Binlong Li; Shenggui Zhang (Discuss. Math. Graph Theory, 2016)

Set systems with k-wise L-intersections and codes with restricted Hamming distances. - Jiuqiang Liu; Shenggui Zhang; Shuchao Li; Huihui Zhang 002 (Eur. J. Comb., 2016)

Rainbow cliques in edge-colored graphs. - Chuandong Xu; Xiaoxue Hu; Weifan Wang 001; Shenggui Zhang (Eur. J. Comb., 2016)

Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. - Binlong Li; Bo Ning 001; Shenggui Zhang (Graphs Comb., 2016)

Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs. - Ruonan Li; Bo Ning 001; Shenggui Zhang (Graphs Comb., 2016)

Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions. - Bo Ning 001; Shenggui Zhang; Binlong Li (Graphs Comb., 2016)

The von Neumann entropy of random multipartite graphs. - Dan Hu; Xueliang Li 001; Xiaogang Liu; Shenggui Zhang (Discret. Appl. Math., 2017)

Cycle extension in edge-colored complete graphs. - Ruonan Li; Hajo Broersma; Chuandong Xu; Shenggui Zhang (Discret. Math., 2017)

Coulson-type integral formulas for the general energy of polynomials with real roots. - Lu Qiao; Shenggui Zhang; Jing Li (Appl. Math. Comput., 2018)

Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. - Pengfei Wan; Jianhua Tu; Shenggui Zhang; Binlong Li (Appl. Math. Comput., 2018)

Kernels by properly colored paths in arc-colored digraphs. - Yandong Bai; Shinya Fujita 001; Shenggui Zhang (Discret. Math., 2018)

Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems. - Zhiwei Guo; Xueliang Li 001; Chuandong Xu; Shenggui Zhang (Discret. Math., 2018)

Conditions for graphs to be path partition optimal. - Binlong Li; Hajo Broersma; Shenggui Zhang (Discret. Math., 2018)

Families of vector spaces with r-wise L-intersections. - Jimeng Xiao; Jiuqiang Liu; Shenggui Zhang (Discret. Math., 2018)

Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs. - Shinya Fujita 001; Ruonan Li; Shenggui Zhang (J. Graph Theory, 2018)

Graph entropy based on the number of spanning forests of c-cyclic graphs. - Pengfei Wan; Jianhua Tu; Matthias Dehmer; Shenggui Zhang; Frank Emmert-Streib (Appl. Math. Comput., 2019)

A new proof on the Ramsey number of matchings. - Chuandong Xu; Hongna Yang; Shenggui Zhang (CoRR, 2019)

Properly colored $C_{4}$'s in edge-colored graphs. - Chuandong Xu; Colton Magnant; Shenggui Zhang (CoRR, 2019)

On sufficient conditions for rainbow cycles in edge-colored graphs. - Shinya Fujita 001; Bo Ning 001; Chuandong Xu; Shenggui Zhang (Discret. Math., 2019)

Fractional chromatic numbers of tensor products of three graphs. - Jimeng Xiao; Huajun Zhang; Shenggui Zhang (Discret. Math., 2019)

Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs. - Ruonan Li; Hajo Broersma; Shenggui Zhang (Graphs Comb., 2019)

Six-flows on almost balanced signed graphs. - Xiao Wang; You Lu 002; Cun-Quan Zhang; Shenggui Zhang (J. Graph Theory, 2019)

Laplacian state transfer in Q-graph. - Yipeng Li; Xiaogang Liu; Shenggui Zhang (Appl. Math. Comput., 2020)

Kernels by rainbow paths in arc-colored tournaments. - Yandong Bai; Binlong Li; Shenggui Zhang (Discret. Appl. Math., 2020)

A classification of edge-colored graphs based on properly colored walks. - Ruonan Li; Binlong Li; Shenggui Zhang (Discret. Appl. Math., 2020)

On characterizing the critical graphs for matching Ramsey numbers. - Chuandong Xu; Hongna Yang; Shenggui Zhang (Discret. Appl. Math., 2020)

Edge coloring of signed graphs. - Li Zhang; You Lu 002; Rong Luo; Dong Ye 002; Shenggui Zhang (Discret. Appl. Math., 2020)

Compatible spanning circuits in edge-colored graphs. - Zhiwei Guo; Binlong Li; Xueliang Li 001; Shenggui Zhang (Discret. Math., 2020)

Properly colored C4's in edge-colored graphs. - Chuandong Xu; Colton Magnant; Shenggui Zhang (Discret. Math., 2020)

Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs. - Wei Zheng 008; Hajo Broersma; Ligong Wang 001; Shenggui Zhang (Discret. Math., 2020)

Sub-Ramsey Numbers for Matchings. - Fangfang Wu; Shenggui Zhang; Binlong Li (Graphs Comb., 2020)

Neighbor Sum Distinguishing Total Choosability of Cubic Graphs. - Donghan Zhang; You Lu 002; Shenggui Zhang (Graphs Comb., 2020)

On graph entropy measures based on the number of independent sets and matchings. - Pengfei Wan; Xinzhuang Chen; Jianhua Tu; Matthias Dehmer; Shenggui Zhang; Frank Emmert-Streib (Inf. Sci., 2020)

Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. - Zhiwei Guo; Hajo Broersma; Ruonan Li; Shenggui Zhang (J. Comb. Optim., 2020)

Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs. - Ruonan Li; Hajo Broersma; Shenggui Zhang (J. Graph Theory, 2020)

Maximum values of degree-based entropies of bipartite graphs. - Yanni Dong; Shengning Qiao; Bing Chen 006; Pengfei Wan; Shenggui Zhang (Appl. Math. Comput., 2021)

Flow number of signed Halin graphs. - Xiao Wang; You Lu 002; Shenggui Zhang (Appl. Math. Comput., 2021)

On the Spectra of General Random Mixed Graphs. - Dan Hu; Hajo Broersma; Jiangyou Hou; Shenggui Zhang (Electron. J. Comb., 2021)

Graphs with minimum degree-based entropy. - Yanni Dong; Maximilien Gadouleau; Pengfei Wan; Shenggui Zhang (CoRR, 2021)

Perfect state transfer in NEPS of complete graphs. - Yipeng Li; Xiaogang Liu; Shenggui Zhang; Sanming Zhou (Discret. Appl. Math., 2021)

Almost eulerian compatible spanning circuits in edge-colored graphs. - Zhiwei Guo; Hajo Broersma; Binlong Li; Shenggui Zhang (Discret. Math., 2021)

Edge DP-coloring in planar graphs. - Li Zhang; You Lu 002; Shenggui Zhang (Discret. Math., 2021)

Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles. - Tingting Han; Shenggui Zhang; Yandong Bai; Ruonan Li (Graphs Comb., 2021)

Rainbow Triangles in Arc-Colored Tournaments. - Wei Li; Shenggui Zhang; Yandong Bai; Ruonan Li (Graphs Comb., 2021)

Rainbow triangles in arc-colored digraphs. - Wei Li; Shenggui Zhang; Ruonan Li (Discret. Appl. Math., 2022)

Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs. - Fangfang Wu; Shenggui Zhang; Binlong Li; Tingting Han (Discret. Appl. Math., 2022)

Matching Algorithms of Minimum Input Selection for Structural Controllability Based on Semi-Tensor Product of Matrices. - Naqi Fan; Lijun Zhang 004; Shenggui Zhang; Jiuqiang Liu (J. Syst. Sci. Complex., 2022)

Determining Redundant Links of Multiagent Systems in Keeping or Improving Consensus Convergence Rates. - Xinzhuang Chen; Shenggui Zhang; Lijun Zhang 004; Guihai Yu; Jiuqiang Liu (IEEE Syst. J., 2022)

On Topology Optimization for Event-Triggered Consensus With Triggered Events Reducing and Convergence Rate Improving. - Xinzhuang Chen; Shanshan Gao; Shenggui Zhang; Yu Zhao 014 (IEEE Trans. Circuits Syst. II Express Briefs, 2022)

The effect of graph operations on the degree-based entropy. - Yanni Dong; Hajo Broersma; Changwu Song; Pengfei Wan; Shenggui Zhang (Appl. Math. Comput., 2023)

Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs. - Tingting Han; Hajo Broersma; Yandong Bai; Shenggui Zhang (Discret. Appl. Math., 2023)

Proof of a conjecture on the spectral radius condition for [a, b]-factors. - Jia Wei; Shenggui Zhang (Discret. Math., 2023)

Anti-Ramsey numbers for vertex-disjoint triangles. - Fangfang Wu; Shenggui Zhang; Binlong Li; Jimeng Xiao (Discret. Math., 2023)

Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. - Yuhang Bai; Zhiwei Guo; Shenggui Zhang; Yandong Bai (J. Comb. Optim., 2023)

2-(Ddge-)Connected Edge Domination Number and Matching Number. - Hengzhe Li; Ankang Wei; Shenggui Zhang (Graphs Comb., 2023)

Signed planar graphs with Δ ≥ 8 are Δ-edge-colorable. - Li Zhang; You Lu 002; Shenggui Zhang (Discret. Math., 2023)

Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems. - Shanshan Gao; Shenggui Zhang; Xinzhuang Chen; Xiaodi Song (Appl. Math. Comput., 2023)

Properly colored cycles of different lengths in edge-colored complete graphs. - Tingting Han; Shenggui Zhang; Yandong Bai (Discret. Math., 2023)

The complexity of spanning tree problems involving graphical indices. - Yanni Dong; Hajo Broersma; Yuhang Bai; Shenggui Zhang (Discret. Appl. Math., 2024)

The algebraic connectivity of barbell graphs. - Xiaodi Song; Shenggui Zhang; Xinzhuang Chen; Shanshan Gao (Discret. Math., 2024)

Graphs with minimum degree-entropy. - Yanni Dong; Maximilien Gadouleau; Pengfei Wan; Shenggui Zhang (Inf. Sci., 2024)

Counting rainbow triangles in edge-colored graphs. - Xueliang Li 001; Bo Ning 001; Yongtang Shi; Shenggui Zhang (J. Graph Theory, 2024)

Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs. - Fangfang Wu; Hajo Broersma; Shenggui Zhang; Binlong Li (J. Graph Theory, 2024)

Generating functions and counting formulas for spanning trees and forests in hypergraphs. - Jiuqiang Liu; Shenggui Zhang; Guihai Yu (Adv. Appl. Math., 2024)

Fundamental structures of invariant dual subspaces with respect to a Boolean network. - Dongyao Bi; Lijun Zhang 004; Kuize Zhang; Shenggui Zhang (Autom., 2025)

Rainbow transitive triangles in arc-colored digraphs. - Mengyu Duan; Zhiwei Guo; Binlong Li; Shenggui Zhang (Discret. Appl. Math., 2025)

Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications. - Vedran Krcadinac; Shenggui Zhang; Liming Xiong; Dragan Stevanovic (Discret. Appl. Math., 2025)

Coulson-type integral formulas for the general (skew) Estrada index of a vertex. - Lu Qiao; Shenggui Zhang; Jing Li; Nan Gao (Discret. Appl. Math., 2025)

Closures and heavy pairs for hamiltonicity. - Wangyi Shang; Hajo Broersma; Shenggui Zhang; Binlong Li (Discret. Appl. Math., 2025)

On the algebraic connectivity of token graphs and graphs under perturbations. - Xiaodi Song; Cristina Dalfó; Miguel Angel Fiol; Shenggui Zhang (Discret. Appl. Math., 2025)

An adjacency lemma on signed edge colorings with an application to planar graphs. - Li Zhang; Hajo Broersma; You Lu; Shenggui Zhang (Discret. Appl. Math., 2025)

On proper hamiltonicity and proper (even) pancyclicity of arc-colored complete (balanced bipartite) digraphs. - Mengyu Duan; Zhiwei Guo; Binlong Li; Shenggui Zhang (Discret. Math., 2025)

Properly colored C4→'s in arc-colored complete and complete bipartite digraphs. - Mengyu Duan; Binlong Li; Shenggui Zhang (Discret. Math., 2025)

Local Degree Conditions for Hamiltonicity of Claw-Free Graphs. - Wangyi Shang; Shenggui Zhang; Binlong Li; Xia Liu (Graphs Comb., 2025)

Effects of Adding Edges on the Consensus Convergence Rate of Weighted Directed Chain Networks. - Shanshan Gao 001; Shenggui Zhang; Xinzhuang Chen (IEEE Trans. Autom. Control., 2025)

The consensus performance of leader-follower multi-agent systems under reversing the directions of arcs. - Xiaodi Song; Shenggui Zhang; Jing Li; Shanshan Gao (Appl. Math. Comput., 2026)