Shenggui Zhang

Guihai Yu

Adv. Appl. Math., April, 2024

Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs.

[BibT_eX]

[DOI]

J. Graph Theory, January, 2024

Graphs with minimum degree-entropy.

[BibT_eX]

[DOI]

Inf. Sci., 2024

The algebraic connectivity of barbell graphs.

[BibT_eX]

[DOI]

Discret. Math., 2024

The complexity of spanning tree problems involving graphical indices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

Properly colored cycles of different lengths in edge-colored complete graphs.

[BibT_eX]

[DOI]

Tingting Han

Discret. Math., December, 2023

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

[BibT_eX]

[DOI]

Appl. Math. Comput., September, 2023

Signed planar graphs with Δ ≥ 8 are Δ-edge-colorable.

[BibT_eX]

[DOI]

Li Zhang

Discret. Math., August, 2023

2-(Ddge-)Connected Edge Domination Number and Matching Number.

[BibT_eX]

[DOI]

Hengzhe Li

Ankang Wei

Graphs Comb., April, 2023

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

[BibT_eX]

[DOI]

J. Comb. Optim., March, 2023

Anti-Ramsey numbers for vertex-disjoint triangles.

[BibT_eX]

[DOI]

Discret. Math., 2023

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

[BibT_eX]

[DOI]

Jia Wei

Discret. Math., 2023

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

The effect of graph operations on the degree-based entropy.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2023

2022

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

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. II Express Briefs, 2022

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

[BibT_eX]

[DOI]

IEEE Syst. J., 2022

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

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2022

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Rainbow triangles in arc-colored digraphs.

[BibT_eX]

[DOI]

Wei Li

Discret. Appl. Math., 2022

2021

Rainbow Triangles in Arc-Colored Tournaments.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Edge DP-coloring in planar graphs.

[BibT_eX]

[DOI]

Li Zhang

Discret. Math., 2021

Almost eulerian compatible spanning circuits in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

Perfect state transfer in NEPS of complete graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Graphs with minimum degree-based entropy.

[BibT_eX]

[DOI]

CoRR, 2021

On the Spectra of General Random Mixed Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Flow number of signed Halin graphs.

[BibT_eX]

[DOI]

Xiao Wang

Appl. Math. Comput., 2021

Maximum values of degree-based entropies of bipartite graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

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

[BibT_eX]

[DOI]

Inf. Sci., 2020

Neighbor Sum Distinguishing Total Choosability of Cubic Graphs.

[BibT_eX]

[DOI]

Donghan Zhang

Graphs Comb., 2020

Sub-Ramsey Numbers for Matchings.

[BibT_eX]

[DOI]

Fangfang Wu

Graphs Comb., 2020

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

[BibT_eX]

[DOI]

Discret. Math., 2020

Properly colored C4's in edge-colored graphs.

[BibT_eX]

[DOI]

Colton Magnant

Discret. Math., 2020

Compatible spanning circuits in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Edge coloring of signed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On characterizing the critical graphs for matching Ramsey numbers.

[BibT_eX]

[DOI]

Hongna Yang

Discret. Appl. Math., 2020

A classification of edge-colored graphs based on properly colored walks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Kernels by rainbow paths in arc-colored tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Laplacian state transfer in Q-graph.

[BibT_eX]

[DOI]

Yipeng Li

Xiaogang Liu

Appl. Math. Comput., 2020

2019

Six-flows on almost balanced signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

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

[BibT_eX]

[DOI]

Graphs Comb., 2019

Fractional chromatic numbers of tensor products of three graphs.

[BibT_eX]

[DOI]

Jimeng Xiao

Huajun Zhang

Discret. Math., 2019

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

[BibT_eX]

[DOI]

Discret. Math., 2019

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

[BibT_eX]

[DOI]

Colton Magnant

CoRR, 2019

A new proof on the Ramsey number of matchings.

[BibT_eX]

[DOI]

Hongna Yang

CoRR, 2019

Graph entropy based on the number of spanning forests of c-cyclic graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

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

[BibT_eX]

[DOI]

Shinya Fujita

J. Graph Theory, 2018

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

[BibT_eX]

[DOI]

Jimeng Xiao

Jiuqiang Liu

Discret. Math., 2018

Conditions for graphs to be path partition optimal.

[BibT_eX]

[DOI]

Discret. Math., 2018

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

[BibT_eX]

[DOI]

Discret. Math., 2018

Kernels by properly colored paths in arc-colored digraphs.

[BibT_eX]

[DOI]

Shinya Fujita

Discret. Math., 2018

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

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

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

[BibT_eX]

[DOI]

Lu Qiao

Jing Li

Appl. Math. Comput., 2018

2017

Cycle extension in edge-colored complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

The von Neumann entropy of random multipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

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

[BibT_eX]

[DOI]

Graphs Comb., 2016

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

[BibT_eX]

[DOI]

Graphs Comb., 2016

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

[BibT_eX]

[DOI]

Graphs Comb., 2016

Rainbow cliques in edge-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

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

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

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

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Forbidden subgraphs for hamiltonicity of 1-tough graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

2015

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

[BibT_eX]

[DOI]

Yi Wang

Inf. Process. Lett., 2015

Characterizing Heavy Subgraph Pairs for Pancyclicity.

[BibT_eX]

[DOI]

Graphs Comb., 2015

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

[BibT_eX]

[DOI]

Discret. Math., 2015

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

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Rainbow triangles in edge-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Heavy subgraph pairs for traceability of block-chains.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

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

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2014

2013

Forbidden subgraph pairs for traceability of block-chains.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2013

Covering digraphs with small indegrees or outdegrees by directed cuts.

[BibT_eX]

[DOI]

Discret. Math., 2013

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

[BibT_eX]

[DOI]

Discret. Math., 2013

2012

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

[BibT_eX]

[DOI]

IEEE Trans. Reliab., 2012

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

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

[BibT_eX]

[DOI]

Graphs Comb., 2012

Pairs of forbidden induced subgraphs for homogeneously traceable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

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

[BibT_eX]

[DOI]

Discret. Math., 2012

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

[BibT_eX]

[DOI]

Discret. Math., 2012

Further results on the eccentric distance sum.

[BibT_eX]

[DOI]

Hongbo Hua

Kexiang Xu

Discret. Appl. Math., 2012

On the reciprocal degree distance of graphs.

[BibT_eX]

[DOI]

Hongbo Hua

Discret. Appl. Math., 2012

Notes on heavy cycles in weighted digraphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

2011

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

[BibT_eX]

[DOI]

Hongbo Hua

Discret. Appl. Math., 2011

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

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

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

[BibT_eX]

[DOI]

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

2010

Vertex-disjoint chorded cycles in a graph.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

On extremal weighted digraphs with no heavy paths.

[BibT_eX]

[DOI]

Discret. Math., 2010

Extremal graphs with given order and the rupture degree.

[BibT_eX]

[DOI]

Yinkui Li

Comput. Math. Appl., 2010

Integrated importance measures of multi-state systems under uncertainty.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2010

Computing the Scattering Number of Bicyclic Graphs.

[BibT_eX]

[DOI]

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

Computing the connectivity indices of α- and β-cyclodextrins.

[BibT_eX]

[DOI]

Wu Jiang

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

2009

Degree sum conditions for oriented forests in digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

Hamilton cycles in claw-heavy graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

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

[BibT_eX]

[DOI]

Zongtian Wei

Int. J. Comput. Math., 2008

Vulnerability parameters of split graphs.

[BibT_eX]

[DOI]

Yinkui Li

Qilong Zhang

Int. J. Comput. Math., 2008

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

[BibT_eX]

[DOI]

T. C. Edwin Cheng

Discret. Math., 2008

Vertex-Neighbor-Integrity of Composition Graphs of Paths.

[BibT_eX]

Zongtian Wei

Ars Comb., 2008

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

[BibT_eX]

Ars Comb., 2008

2007

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

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Algorithms for symmetric groups of simplexes.

[BibT_eX]

[DOI]

Huiling Lin

Appl. Math. Comput., 2007

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

[BibT_eX]

[DOI]

T. C. Edwin Cheng

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.

[BibT_eX]

[DOI]

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

2006

Edge vulnerability parameters of split graphs.

[BibT_eX]

[DOI]

Qilong Zhang

Appl. Math. Lett., 2006

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

[BibT_eX]

[DOI]

Appl. Math. Lett., 2006

2005

Heavy cycles passing through some specified vertices in weighted graphs.

[BibT_eX]

[DOI]

Jun Fujisawa

Kiyoshi Yoshimoto

J. Graph Theory, 2005

Rupture degree of graphs.

[BibT_eX]

[DOI]

Yinkui Li

Int. J. Comput. Math., 2005

Paths and cycles in colored graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

The Binding Number of a Digraph.

[BibT_eX]

[DOI]

Genjiu Xu

Proceedings of the Discrete Geometry, 2005

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

[BibT_eX]

[DOI]

T. C. Edwin Cheng

Proceedings of the Discrete Geometry, 2005

2004

Relationships between scattering number and other vulnerability parameters.

[BibT_eX]

[DOI]

Shuying Peng

Int. J. Comput. Math., 2004

Heavy cycles in k-connected weighted graphs.

[BibT_eX]

[DOI]

Rongzu Yu

Electron. Notes Discret. Math., 2004

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

[BibT_eX]

[DOI]

Discret. Math., 2004

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

[BibT_eX]

[DOI]

Ligong Wang

Discret. Appl. Math., 2004

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

[BibT_eX]

[DOI]

Sui Sun Cheng

Appl. Math. Comput., 2004

2002

Computing the Scattering Number of Graphs.

[BibT_eX]

[DOI]

Xinglou Han

Int. J. Comput. Math., 2002

A Fan Type Condition For Heavy Cycles in Weighted Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

2001

Scattering number in graphs.

[BibT_eX]

[DOI]

Ziguo Wang

Networks, 2001

A Co-Marginalistic Contribution Value for Set Games.

[BibT_eX]

[DOI]

IGTR, 2001

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

[BibT_eX]

[DOI]

Ligong Wang

Electron. Notes Discret. Math., 2001

Paths and Cycles in Colored Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

A σ3 type condition for heavy cycles in weighted graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2001

2000

Heavy paths and cycles in weighted graphs.

[BibT_eX]

[DOI]