# Mei Lu

According to our database

Collaborative distances:

^{1}, Mei Lu authored at least 63 papers between 1995 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

The

*g*-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model.
Theor. Comput. Sci., 2019

Bounding the locating-total domination number of a tree in terms of its annihilation number.

Discussiones Mathematicae Graph Theory, 2019

Matching in 3-uniform hypergraphs.

Discrete Mathematics, 2019

Identifying codes in the direct product of a complete graph and some special graphs.

Discrete Applied Mathematics, 2019

2018

Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation.

Memetic Computing, 2018

d-matching in 3-uniform hypergraphs.

Discrete Mathematics, 2018

On the signless Laplacian Estrada index of bicyclic graphs.

Discrete Applied Mathematics, 2018

The anti-adjacency matrix of a graph: Eccentricity matrix.

Discrete Applied Mathematics, 2018

Vertex Degree Sums for Perfect Matchings in 3-Uniform Hypergraphs.

Electr. J. Comb., 2018

Matching of 5-

*γ*-critical leafless graph with a cut edge.
Applied Mathematics and Computation, 2018

Conditional diagnosability of the

*SP*graphs under the comparison diagnosis model._{n}
Applied Mathematics and Computation, 2018

2017

The g-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model.

Theor. Comput. Sci., 2017

Conditional diagnosability of the round matching composition networks.

Theor. Comput. Sci., 2017

Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization.

Neural Computing and Applications, 2017

d-matching in k-uniform hypergraphs.

Discrete Math., Alg. and Appl., 2017

Universal arcs in local tournaments.

Discrete Mathematics, 2017

On the Szeged index of unicyclic graphs with given diameter.

Discrete Applied Mathematics, 2017

Locating and differentiating-total dominating sets in unicyclic graphs.

Ars Comb., 2017

2016

The extra connectivity of bubble-sort star graphs.

Theor. Comput. Sci., 2016

Self-adaptive extreme learning machine.

Neural Computing and Applications, 2016

Constrained neighborhood preserving concept factorization for data representation.

Knowl.-Based Syst., 2016

Semi-supervised concept factorization for document clustering.

Inf. Sci., 2016

Two coloring problems on matrix graphs.

Discrete Math., Alg. and Appl., 2016

Bounds on the differentiating-total domination number of a tree.

Discrete Applied Mathematics, 2016

On pancyclic arcs in hypertournaments.

Discrete Applied Mathematics, 2016

Conditional diagnosability of bubble-sort star graphs.

Discrete Applied Mathematics, 2016

An improved bat algorithm with variable neighborhood search for global optimization.

Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2015

Linearized Wenger graphs.

Discrete Mathematics, 2015

Fault-tolerant maximal local-connectivity on Bubble-sort star graphs.

Discrete Applied Mathematics, 2015

Lai's Conditions for Spanning and Dominating Closed Trails.

Electr. J. Comb., 2015

2014

2-Distance paired-dominating number of graphs.

J. Comb. Optim., 2014

Maximum Randic Index on Unicyclic Graphs with k Pendant Vertices.

Ars Comb., 2014

Information Technology Service Delivery to Small Businesses.

Proceedings of the HCI in Business - First International Conference, 2014

2013

3D Object Retrieval Based on PSO-K-Modes Method.

JSW, 2013

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs.

Discrete Mathematics, 2013

On the zeroth-order general Randic index of unicycle graphs with k pendant vertices.

Ars Comb., 2013

2012

Fault-tolerant diameter for three family interconnection networks.

J. Comb. Optim., 2012

Edge fault tolerance of super edge connectivity for three families of interconnection networks.

Inf. Sci., 2012

Weakly quasi-Hamiltonian-set-connected multipartite tournaments.

Discrete Applied Mathematics, 2012

A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices.

Ars Comb., 2012

On the zeroth-order general Randic index of cacti.

Ars Comb., 2012

2011

From Personal to Collaborative Information Management: A Design Science's Approach.

Proceedings of the Human Interface and the Management of Information. Interacting with Information, 2011

2009

The structure of even factors in claw-free graphs.

Discrete Mathematics, 2009

An improved upper bound for the Laplacian spectral radius of graphs.

Discrete Mathematics, 2009

Bi-cycle extendable through a given set in balanced bipartite graphs.

Discrete Applied Mathematics, 2009

2007

Laplacian spectral bounds for clique and independence numbers of graphs.

J. Comb. Theory, Ser. B, 2007

Relative Length of Longest Paths and Cycles in Graphs.

Graphs and Combinatorics, 2007

2006

MRI detects white matter reorganization after neural progenitor cell treatment of stroke.

NeuroImage, 2006

Trees of extremal connectivity index.

Discrete Applied Mathematics, 2006

2005

Investigation of neural progenitor cell induced angiogenesis after embolic stroke in rat using MRI.

NeuroImage, 2005

Two sufficient conditions for dominating cycles.

Journal of Graph Theory, 2005

How virtual are we? Measuring virtuality and understanding its impact in a global organization.

Inf. Syst. J., 2005

Fan-Type Theorem for Long Cycles Containing a Specified Edge.

Graphs and Combinatorics, 2005

Fuzzy quadratic minimum spanning tree problem.

Applied Mathematics and Computation, 2005

Does Distance Matter? - Bridging the Discontinuities in Distributed Organizations.

Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005

2004

Neighborhood unions and cyclability of graphs.

Discrete Applied Mathematics, 2004

Chance-constrained programming for fuzzy quadratic minimum spanning tree problem.

Proceedings of the IEEE International Conference on Fuzzy Systems, 2004

2002

Hamiltonian cycles in 3-connected Claw-free graphs.

Discrete Mathematics, 2002

2001

Cycles of length 1 modulo 3 in graph.

Discrete Applied Mathematics, 2001

1999

Object-Oriented Requirements Modeling Based on UML.

Proceedings of the TOOLS 1999: 31st International Conference on Technology of Object-Oriented Languages and Systems, 1999

1998

Hamiltonicity in 2-connected graphs with claws.

Discrete Mathematics, 1998

1997

Hamiltonicity of 2-connected claw-center independent graphs.

Discrete Mathematics, 1997

1995

View-Based Techniques for Searching for Objects and Textures.

Proceedings of the Recent Developments in Computer Vision, 1995