Shenggui Zhang

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 64

Top Venues

Publications

Yanni Dong, Hajo Broersma, Yuhang Bai, Shenggui Zhang
The complexity of spanning tree problems involving graphical indices. Discret. Appl. Math. 347 (2024)
Fangfang Wu, Hajo Broersma, Shenggui Zhang, Binlong Li
Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs. J. Graph Theory 105 (1) (2024)
Xiaodi Song, Shenggui Zhang, Xinzhuang Chen, Shanshan Gao
The algebraic connectivity of barbell graphs. Discret. Math. 347 (7) (2024)
Yanni Dong, Maximilien Gadouleau, Pengfei Wan, Shenggui Zhang
Graphs with minimum degree-entropy. Inf. Sci. 671 (2024)
Jiuqiang Liu, Shenggui Zhang, Guihai Yu
Generating functions and counting formulas for spanning trees and forests in hypergraphs. Adv. Appl. Math. 155 (2024)
Tingting Han, Hajo Broersma, Yandong Bai, Shenggui Zhang
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs. Discret. Appl. Math. 327 (2023)
Tingting Han, Shenggui Zhang, Yandong Bai
Properly colored cycles of different lengths in edge-colored complete graphs. Discret. Math. 346 (12) (2023)
Hengzhe Li, Ankang Wei, Shenggui Zhang
2-(Ddge-)Connected Edge Domination Number and Matching Number. Graphs Comb. 39 (2) (2023)
Jia Wei, Shenggui Zhang
]-factors. Discret. Math. 346 (3) (2023)
Shanshan Gao, Shenggui Zhang, Xinzhuang Chen, Xiaodi Song
Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems. Appl. Math. Comput. 453 (2023)
Fangfang Wu, Shenggui Zhang, Binlong Li, Jimeng Xiao
Anti-Ramsey numbers for vertex-disjoint triangles. Discret. Math. 346 (1) (2023)
Li Zhang, You Lu, Shenggui Zhang
Signed planar graphs with Δ ≥ 8 are Δ-edge-colorable. Discret. Math. 346 (8) (2023)
Yanni Dong, Hajo Broersma, Changwu Song, Pengfei Wan, Shenggui Zhang
The effect of graph operations on the degree-based entropy. Appl. Math. Comput. 437 (2023)
Yuhang Bai, Zhiwei Guo, Shenggui Zhang, Yandong Bai
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. J. Comb. Optim. 45 (2) (2023)
Wei Li, Shenggui Zhang, Ruonan Li
Rainbow triangles in arc-colored digraphs. Discret. Appl. Math. 314 (2022)
Naqi Fan, Lijun Zhang, Shenggui Zhang, Jiuqiang Liu
Matching Algorithms of Minimum Input Selection for Structural Controllability Based on Semi-Tensor Product of Matrices. J. Syst. Sci. Complex. 35 (5) (2022)
Xinzhuang Chen, Shenggui Zhang, Lijun Zhang, Guihai Yu, Jiuqiang Liu
Determining Redundant Links of Multiagent Systems in Keeping or Improving Consensus Convergence Rates. IEEE Syst. J. 16 (4) (2022)
Xinzhuang Chen, Shanshan Gao, Shenggui Zhang, Yu Zhao
On Topology Optimization for Event-Triggered Consensus With Triggered Events Reducing and Convergence Rate Improving. IEEE Trans. Circuits Syst. II Express Briefs 69 (3) (2022)
Fangfang Wu, Shenggui Zhang, Binlong Li, Tingting Han
Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs. Discret. Appl. Math. 307 (2022)
Dan Hu, Hajo Broersma, Jiangyou Hou, Shenggui Zhang
On the Spectra of General Random Mixed Graphs. Electron. J. Comb. 28 (1) (2021)
Yanni Dong, Maximilien Gadouleau, Pengfei Wan, Shenggui Zhang
Graphs with minimum degree-based entropy. CoRR (2021)
Xiao Wang, You Lu, Shenggui Zhang
Flow number of signed Halin graphs. Appl. Math. Comput. 393 (2021)
Yanni Dong, Shengning Qiao, Bing Chen, Pengfei Wan, Shenggui Zhang
Maximum values of degree-based entropies of bipartite graphs. Appl. Math. Comput. 401 (2021)
Zhiwei Guo, Hajo Broersma, Binlong Li, Shenggui Zhang
Almost eulerian compatible spanning circuits in edge-colored graphs. Discret. Math. 344 (1) (2021)
Tingting Han, Shenggui Zhang, Yandong Bai, Ruonan Li
Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles. Graphs Comb. 37 (3) (2021)
Wei Li, Shenggui Zhang, Yandong Bai, Ruonan Li
Rainbow Triangles in Arc-Colored Tournaments. Graphs Comb. 37 (4) (2021)
Li Zhang, You Lu, Shenggui Zhang
Edge DP-coloring in planar graphs. Discret. Math. 344 (5) (2021)
Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou
Perfect state transfer in NEPS of complete graphs. Discret. Appl. Math. 289 (2021)
Ruonan Li, Binlong Li, Shenggui Zhang
A classification of edge-colored graphs based on properly colored walks. Discret. Appl. Math. 283 (2020)
Fangfang Wu, Shenggui Zhang, Binlong Li
Sub-Ramsey Numbers for Matchings. Graphs Comb. 36 (6) (2020)
Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. J. Comb. Optim. 40 (4) (2020)
Chuandong Xu, Hongna Yang, Shenggui Zhang
On characterizing the critical graphs for matching Ramsey numbers. Discret. Appl. Math. 287 (2020)
Yipeng Li, Xiaogang Liu, Shenggui Zhang
-graph. Appl. Math. Comput. 384 (2020)
Chuandong Xu, Colton Magnant, Shenggui Zhang
Properly colored C4's in edge-colored graphs. Discret. Math. 343 (12) (2020)
Ruonan Li, Hajo Broersma, Shenggui Zhang
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs. J. Graph Theory 94 (3) (2020)
Wei Zheng, Hajo Broersma, Ligong Wang, Shenggui Zhang
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs. Discret. Math. 343 (1) (2020)
Zhiwei Guo, Binlong Li, Xueliang Li, Shenggui Zhang
Compatible spanning circuits in edge-colored graphs. Discret. Math. 343 (7) (2020)
Li Zhang, You Lu, Rong Luo, Dong Ye, Shenggui Zhang
Edge coloring of signed graphs. Discret. Appl. Math. 282 (2020)
Yandong Bai, Binlong Li, Shenggui Zhang
Kernels by rainbow paths in arc-colored tournaments. Discret. Appl. Math. 282 (2020)
Donghan Zhang, You Lu, Shenggui Zhang
Neighbor Sum Distinguishing Total Choosability of Cubic Graphs. Graphs Comb. 36 (5) (2020)
Pengfei Wan, Xinzhuang Chen, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib
On graph entropy measures based on the number of independent sets and matchings. Inf. Sci. 516 (2020)
Ruonan Li, Hajo Broersma, Shenggui Zhang
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs. Graphs Comb. 35 (1) (2019)
Pengfei Wan, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib
-cyclic graphs. Appl. Math. Comput. 363 (2019)
Xiao Wang, You Lu, Cun-Quan Zhang, Shenggui Zhang
Six-flows on almost balanced signed graphs. J. Graph Theory 92 (4) (2019)
Jimeng Xiao, Huajun Zhang, Shenggui Zhang
Fractional chromatic numbers of tensor products of three graphs. Discret. Math. 342 (5) (2019)
Chuandong Xu, Colton Magnant, Shenggui Zhang
Properly colored $C_{4}$'s in edge-colored graphs. CoRR (2019)
Chuandong Xu, Hongna Yang, Shenggui Zhang
A new proof on the Ramsey number of matchings. CoRR (2019)
Shinya Fujita, Bo Ning, Chuandong Xu, Shenggui Zhang
On sufficient conditions for rainbow cycles in edge-colored graphs. Discret. Math. 342 (7) (2019)
Shinya Fujita, Ruonan Li, Shenggui Zhang
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs. J. Graph Theory 87 (3) (2018)
Zhiwei Guo, Xueliang Li, Chuandong Xu, Shenggui Zhang
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems. Discret. Math. 341 (7) (2018)
Lu Qiao, Shenggui Zhang, Jing Li
Coulson-type integral formulas for the general energy of polynomials with real roots. Appl. Math. Comput. 320 (2018)
Pengfei Wan, Jianhua Tu, Shenggui Zhang, Binlong Li
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. Appl. Math. Comput. 332 (2018)
Yandong Bai, Shinya Fujita, Shenggui Zhang
Kernels by properly colored paths in arc-colored digraphs. Discret. Math. 341 (6) (2018)
Binlong Li, Hajo Broersma, Shenggui Zhang
Conditions for graphs to be path partition optimal. Discret. Math. 341 (5) (2018)
Jimeng Xiao, Jiuqiang Liu, Shenggui Zhang
Families of vector spaces with r-wise L-intersections. Discret. Math. 341 (4) (2018)
Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang
The von Neumann entropy of random multipartite graphs. Discret. Appl. Math. 232 (2017)
Ruonan Li, Hajo Broersma, Chuandong Xu, Shenggui Zhang
Cycle extension in edge-colored complete graphs. Discret. Math. 340 (6) (2017)
Hajo Broersma, Binlong Li, Shenggui Zhang
Forbidden subgraphs for hamiltonicity of 1-tough graphs. Discuss. Math. Graph Theory 36 (4) (2016)
Bo Ning, Shenggui Zhang, Binlong Li
Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions. Graphs Comb. 32 (3) (2016)
Ruonan Li, Bo Ning, Shenggui Zhang
Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs. Graphs Comb. 32 (5) (2016)
Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang
Rainbow cliques in edge-colored graphs. Eur. J. Comb. 54 (2016)
Binlong Li, Bo Ning, Shenggui Zhang
Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. Graphs Comb. 32 (1) (2016)
Jiuqiang Liu, Shenggui Zhang, Shuchao Li, Huihui Zhang
Set systems with k-wise L-intersections and codes with restricted Hamming distances. Eur. J. Comb. 58 (2016)
Binlong Li, Shenggui Zhang
Heavy subgraph conditions for longest cycles to be heavy in graphs. Discuss. Math. Graph Theory 36 (2) (2016)
Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang
Characterizing Heavy Subgraph Pairs for Pancyclicity. Graphs Comb. 31 (3) (2015)
Chuandong Xu, Shenggui Zhang, Bo Ning, Binlong Li
A note on the number of spanning trees of line digraphs. Discret. Math. 338 (5) (2015)
Chuandong Xu, Shenggui Zhang, Yi Wang
On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees. Inf. Process. Lett. 115 (12) (2015)
Binlong Li, Shenggui Zhang
Forbidden subgraphs for longest cycles to contain vertices with large degrees. Discret. Math. 338 (10) (2015)
Hajo Broersma, Binlong Li, Shenggui Zhang
Heavy subgraph pairs for traceability of block-chains. Discuss. Math. Graph Theory 34 (2) (2014)
Binlong Li, Bo Ning, Chuandong Xu, Shenggui Zhang
Rainbow triangles in edge-colored graphs. Eur. J. Comb. 36 (2014)
Bo Ning, Shenggui Zhang, Bing Chen
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs. Discret. Math. Algorithms Appl. 6 (3) (2014)
Bo Ning, Shenggui Zhang
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs. Discret. Math. 313 (17) (2013)
Binlong Li, Hajo Broersma, Shenggui Zhang
Forbidden subgraph pairs for traceability of block-chains. Electron. J. Graph Theory Appl. 1 (1) (2013)
Chuandong Xu, Shenggui Zhang, You Lu
Covering digraphs with small indegrees or outdegrees by directed cuts. Discret. Math. 313 (16) (2013)
Binlong Li, Hajo Broersma, Shenggui Zhang
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discret. Math. 312 (18) (2012)
Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang
Star subdivisions and connected even factors in the square of a graph. Discret. Math. 312 (17) (2012)
Binlong Li, Zdenek Ryjácek, Ying Wang, Shenggui Zhang
Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs. SIAM J. Discret. Math. 26 (3) (2012)
Shengning Qiao, Shenggui Zhang
Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs. Graphs Comb. 28 (2) (2012)
Hongbo Hua, Shenggui Zhang, Kexiang Xu
Further results on the eccentric distance sum. Discret. Appl. Math. 160 (1-2) (2012)
Hongbo Hua, Shenggui Zhang
On the reciprocal degree distance of graphs. Discret. Appl. Math. 160 (7-8) (2012)
Yandong Bai, Binlong Li, Shenggui Zhang
Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts. Discret. Math. 312 (10) (2012)
Binlong Li, Shenggui Zhang
Notes on heavy cycles in weighted digraphs. Appl. Math. Lett. 25 (11) (2012)
Shubin Si, Hongyan Dui, Xibin Zhao, Shenggui Zhang, Shudong Sun
Integrated Importance Measure of Component States Based on Loss of System Performance. IEEE Trans. Reliab. 61 (1) (2012)
Hongbo Hua, Shenggui Zhang
Graphs with given number of cut vertices and extremal Merrifield-Simmons index. Discret. Appl. Math. 159 (10) (2011)
Bolin Chen, Yan Yan, Jin-Hong Shi, Shenggui Zhang, Fang-Xiang Wu
An Improved Graph Entropy-based Method for Identifying Protein Complexes. BIBM (2011)
Binlong Li, Shenggui Zhang
Heavy cycles and spanning trees with few leaves in weighted graphs. Appl. Math. Lett. 24 (6) (2011)
Shengning Qiao, Shenggui Zhang
Vertex-disjoint chorded cycles in a graph. Oper. Res. Lett. 38 (6) (2010)
Wu Jiang, Shenggui Zhang
Computing the connectivity indices of α- and β-cyclodextrins. BIBM Workshops (2010)
Binlong Li, Shenggui Zhang
On extremal weighted digraphs with no heavy paths. Discret. Math. 310 (10-11) (2010)
Bing Chen, Shenggui Zhang
Computing the Scattering Number of Bicyclic Graphs. CIS (2010)
Shubin Si, Zhiqiang Cai, Shudong Sun, Shenggui Zhang
Integrated importance measures of multi-state systems under uncertainty. Comput. Ind. Eng. 59 (4) (2010)
Yinkui Li, Shenggui Zhang
Extremal graphs with given order and the rupture degree. Comput. Math. Appl. 60 (6) (2010)
T. C. Edwin Cheng, Yonglin Guo, Shenggui Zhang, Yongjun Du
Extreme values of the sum of squares of degrees of bipartite graphs. Discret. Math. 309 (6) (2009)
Bing Chen, Shenggui Zhang, Shengning Qiao
Hamilton cycles in claw-heavy graphs. Discret. Math. 309 (8) (2009)
Shengning Qiao, Shenggui Zhang
Degree sum conditions for oriented forests in digraphs. Discret. Math. 309 (13) (2009)
Bing Chen, Shenggui Zhang
A New s3 Type Condition for Heavy Cycles in Weighted Graphs. Ars Comb. 87 (2008)
Yinkui Li, Shenggui Zhang, Qilong Zhang
Vulnerability parameters of split graphs. Int. J. Comput. Math. 85 (1) (2008)
Zongtian Wei, Shenggui Zhang
Vertex-Neighbor-Integrity of Composition Graphs of Paths. Ars Comb. 86 (2008)
Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
Heavy cycles in k-connected weighted graphs with large weighted degree sums. Discret. Math. 308 (20) (2008)
Zongtian Wei, Shenggui Zhang
Vertex-neighbour-integrity of composition graphs of paths and cycles. Int. J. Comput. Math. 85 (5) (2008)

Shenggui Zhang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Shenggui Zhang