Hengzhe Li

Jiajia Wang

Rong-Xia Hao

J. Interconnect. Networks, September, 2023

Synergetic Theory of Information Entropy Based on Failure Approach Index for Stability Analysis of Surrounding Rock System.

[BibT_eX]

[DOI]

Entropy, August, 2023

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

[BibT_eX]

[DOI]

Ankang Wei

Shenggui Zhang

Graphs Comb., April, 2023

Edge-Disjoint Steiner Trees and Connectors in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., April, 2023

2022

Total Rainbow Connection Number of Some Graph Operations.

[BibT_eX]

[DOI]

Yingbin Ma

Yan Zhao

Axioms, 2022

2021

The vertex- rainbow connection number of some graph operations.

[BibT_eX]

[DOI]

Yingbin Ma

Discuss. Math. Graph Theory, 2021

2020

The κk-connectivity of line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2018

On the Steiner 4-Diameter of Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2018

Making a dominating set of a graph connected.

[BibT_eX]

[DOI]

Baoyindureng Wu

Discuss. Math. Graph Theory, 2018

Steiner tree packing number and tree connectivity.

[BibT_eX]

[DOI]

Discret. Math., 2018

The λ3-connectivity and κ3-connectivity of recursive circulants.

[BibT_eX]

[DOI]

Jiajia Wang

Appl. Math. Comput., 2018

2017

Rainbow connection number of graphs with diameter 3.

[BibT_eX]

[DOI]

Yuefang Sun

Discuss. Math. Graph Theory, 2017

Rainbow connection number and graph operations.

[BibT_eX]

[DOI]

Yingbin Ma

Discret. Appl. Math., 2017

The chromatic equivalence class of graph ψn3(n-3, 1).

[BibT_eX]

Ars Comb., 2017

The generalized 3-connectivity of graph products.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

2016

Algorithm on rainbow connection for maximal outerplanar graphs.

[BibT_eX]

[DOI]

Xingchao Deng

Guiying Yan

Theor. Comput. Sci., 2016

2-Edge connected dominating sets and 2-Connected dominating sets of a graph.

[BibT_eX]

[DOI]

Yuxing Yang

Baoyindureng Wu

J. Comb. Optim., 2016

2015

Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees.

[BibT_eX]

[DOI]

Wei-Hua He

Int. J. Comput. Math., 2015

Note on the spanning-tree packing number of lexicographic product graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

A kind of conditional vertex connectivity of recursive circulants.

[BibT_eX]

Jixiang Meng

Ars Comb., 2015

2014

Note on Minimally d-Rainbow Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Oriented diameter and rainbow connection number of a graph.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Note on the generalized connectivity.

[BibT_eX]

Ars Comb., 2014

2012

The generalized 3-connectivity of Cartesian product.

[BibT_eX]

[DOI]

Yuefang Sun

Discret. Math. Theor. Comput. Sci., 2012

Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees.

[BibT_eX]

[DOI]

Jixiang Meng

Discret. Math., 2012

Rainbow connection of graphs with diameter 2.

[BibT_eX]

[DOI]

Sujuan Liu

Discret. Math., 2012

2011

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups.

[BibT_eX]

[DOI]

Sujuan Liu

Comput. Math. Appl., 2011

2010

Conditional connectivity of Cayley graphs generated by transposition trees.

[BibT_eX]

[DOI]

Jixiang Meng

Inf. Process. Lett., 2010

A kind of conditional fault tolerance of (n, k)-star graphs.

[BibT_eX]

[DOI]