Mei Lu

Appl. Math. Comput., 2025

2024

Treewidth of the q-Kneser graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., January, 2024

Erdős-Ko-Rado theorem for bounded multisets.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2024

Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Vertex degree sums for matchings in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2024

Many triangles in C5-free graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2024

A Polynomial Time Algorithm to Find Star Chromatic Index on Bounded Treewidth Graphs with Given Maximum Degree.

[BibT_eX]

[DOI]

Yichen Wang

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., November, 2023

Fractional matching preclusion numbers of Cartesian product graphs.

[BibT_eX]

[DOI]

Yu Luan

Discret. Appl. Math., October, 2023

Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index.

[BibT_eX]

[DOI]

Jing Zhao

Appl. Math. Comput., September, 2023

Triangles in r-wise t-intersecting families.

[BibT_eX]

[DOI]

Jiaqi Liao

Mengyu Cao

Eur. J. Comb., August, 2023

On graphs with exactly one anti-adjacency eigenvalue and beyond.

[BibT_eX]

[DOI]

Discret. Math., June, 2023

r-cross t-intersecting families for vector spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2023

Saturation numbers for disjoint stars.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

Minimum tP3-saturation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

On the P3-hull numbers of q-Kneser graphs and Grassmann graphs.

[BibT_eX]

[DOI]

Jiaqi Liao

Mengyu Cao

Appl. Math. Comput., 2023

Validation of the PTPI Scale for Technology Products Among Users with Disabilities.

[BibT_eX]

[DOI]

Carmen A. Van Ommen

Barbara S. Chaparro

Joseph Roland Keebler

Sanjay Batra

Proceedings of the Universal Access in Human-Computer Interaction, 2023

2022

Adaptively local consistent concept factorization for multi-view clustering.

[BibT_eX]

[DOI]

Li Zhang

Fanzhang Li

Soft Comput., 2022

Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

The fractional matching preclusion number of complete n-balanced k-partite graphs.

[BibT_eX]

[DOI]

Yu Luan

J. Comb. Optim., 2022

Density of Balanced 3-Partite Graphs without 3-Cycles or 4-Cycles.

[BibT_eX]

[DOI]

Chunqiu Fang

Electron. J. Comb., 2022

Treewidth of the Generalized Kneser Graphs.

[BibT_eX]

[DOI]

Mengyu Cao

Electron. J. Comb., 2022

Anti-Ramsey numbers for cycles in the generalized Petersen graphs.

[BibT_eX]

[DOI]

Shunzhe Zhang

Appl. Math. Comput., 2022

The (strong) structure connectivity and (strong) substructure connectivity of the (n, k)-bubble-sort network.

[BibT_eX]

[DOI]

Xin Wang

Appl. Math. Comput., 2022

Spectral determinations and eccentricity matrix of graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2022

Precipitation Prediction Caused by Typhoon Based on LSTM network.

[BibT_eX]

[DOI]

Proceedings of the ICCDA 2022: The 6th International Conference on Compute and Data Analysis, Virtual Event / Shanghai, China, February 25, 2022

2021

The fractional (strong) matching preclusion number of complete k-partite graph.

[BibT_eX]

[DOI]

Yu Luan

Theor. Comput. Sci., 2021

Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees.

[BibT_eX]

[DOI]

Yuxing Jia

Graphs Comb., 2021

The treewidth of 2-section of hypergraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

The terminal-pairability problem in complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

A note on the minimum inverse sum indeg index of cacti.

[BibT_eX]

[DOI]

Yisheng Jiang

Discret. Appl. Math., 2021

Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On the anti-Ramsey number of forests.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling.

[BibT_eX]

[DOI]

Xiaokang Han

Wenzhou Yan

Complex., 2021

Saturation Number of $tK_{l, l, l}$ in the Complete Tripartite Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Anti-Ramsey problems for cycles.

[BibT_eX]

[DOI]

Jiale Xu

Appl. Math. Comput., 2021

Maximal augmented Zagreb index of trees with given diameter.

[BibT_eX]

[DOI]

Yisheng Jiang

Appl. Math. Comput., 2021

2020

Quantum inspired monarch butterfly optimisation for UCAV path planning navigation problem.

[BibT_eX]

[DOI]

Jiao-Hong Yi

Xiang-Jun Zhao

Int. J. Bio Inspired Comput., 2020

Bounds on the locating-total domination number in trees.

[BibT_eX]

[DOI]

Kun Wang

Discuss. Math. Graph Theory, 2020

Super edge-connectivity and zeroth-order Randiæ index.

[BibT_eX]

[DOI]

Zhihong He

Discuss. Math. Graph Theory, 2020

Spectral properties of the eccentricity matrix of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Survey on lie group machine learning.

[BibT_eX]

[DOI]

Fanzhang Li

Big Data Min. Anal., 2020

Perfect matching and Hamilton cycle decomposition of complete balanced (k+1)-partite k-uniform hypergraphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

An Estimate of the Decay rate of Swells using Altimeter Data.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2020

2019

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

[BibT_eX]

[DOI]

Desai Li

Theor. Comput. Sci., 2019

Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles and Matchings.

[BibT_eX]

[DOI]

Yuxing Jia

Graphs Comb., 2019

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

[BibT_eX]

[DOI]

Kun Wang

Discuss. Math. Graph Theory, 2019

Matching in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

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

[BibT_eX]

[DOI]

Jiale Xu

Discret. Appl. Math., 2019

Game total domination for cyclic bipartite graphs.

[BibT_eX]

[DOI]

Yisheng Jiang

Discret. Appl. Math., 2019

Vertex Degree Sums for Matchings in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Yi Zhao

Electron. J. Comb., 2019

Edge-Bipancyclicity of Bubble-Sort Star Graphs.

[BibT_eX]

[DOI]

IEEE Access, 2019

2018

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

[BibT_eX]

[DOI]

Memetic Comput., 2018

d-matching in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

On the signless Laplacian Estrada index of bicyclic graphs.

[BibT_eX]

[DOI]

Kun Wang

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

Yi Zhao

Electron. J. Comb., 2018

Matching of 5-γ-critical leafless graph with a cut edge.

[BibT_eX]

[DOI]

Yuxuan Yang

Appl. Math. Comput., 2018

Conditional diagnosability of the SPn graphs under the comparison diagnosis model.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

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

[BibT_eX]

[DOI]

Desai Li

Theor. Comput. Sci., 2017

Conditional diagnosability of the round matching composition networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

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

[BibT_eX]

[DOI]

Neural Comput. Appl., 2017

d-matching in k-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2017

Universal arcs in local tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2017

On the Szeged index of unicyclic graphs with given diameter.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Locating and differentiating-total dominating sets in unicyclic graphs.

[BibT_eX]

Ars Comb., 2017

2016

The extra connectivity of bubble-sort star graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Self-adaptive extreme learning machine.

[BibT_eX]

[DOI]

Neural Comput. Appl., 2016

Constrained neighborhood preserving concept factorization for data representation.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2016

Semi-supervised concept factorization for document clustering.

[BibT_eX]

[DOI]

Inf. Sci., 2016

Two coloring problems on matrix graphs.

[BibT_eX]

[DOI]

Zhe Han

Discret. Math. Algorithms Appl., 2016

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On pancyclic arcs in hypertournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Conditional diagnosability of bubble-sort star graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

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

[BibT_eX]

[DOI]

Gaige Wang

Xiang-Jun Zhao

Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2015

Linearized Wenger graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

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

[BibT_eX]

[DOI]

Hongyan Cai

Discret. Appl. Math., 2015

Lai's Conditions for Spanning and Dominating Closed Trails.

[BibT_eX]

[DOI]

Wei-Guo Chen

Zhi-Hong Chen

Electron. J. Comb., 2015

2014

2-Distance paired-dominating number of graphs.

[BibT_eX]

[DOI]

Kan Yu

J. Comb. Optim., 2014

Algebraic Cayley graphs over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2014

Maximum Randic Index on Unicyclic Graphs with k Pendant Vertices.

[BibT_eX]

Fan Li

Ars Comb., 2014

Information Technology Service Delivery to Small Businesses.

[BibT_eX]

[DOI]

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

2013

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

[BibT_eX]

[DOI]

Xiangjun Zhao

J. Softw., 2013

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

Yubao Guo

Michel Surmacs

Discret. Math., 2013

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

[BibT_eX]

Fan Li

Ars Comb., 2013

2012

Fault-tolerant diameter for three family interconnection networks.

[BibT_eX]

[DOI]

Tongliang Shi

J. Comb. Optim., 2012

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

[BibT_eX]

[DOI]

Dongye Wang

Inf. Sci., 2012

Weakly quasi-Hamiltonian-set-connected multipartite tournaments.

[BibT_eX]

[DOI]

Yubao Guo

Michel Surmacs

Discret. Appl. Math., 2012

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

[BibT_eX]

Ars Comb., 2012

On the zeroth-order general Randic index of cacti.

[BibT_eX]

Liang Lin

Ars Comb., 2012

2011

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

[BibT_eX]

[DOI]

Philip J. Corriveau

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

2009

The structure of even factors in claw-free graphs.

[BibT_eX]

[DOI]

Liming Xiong

Longsheng Han

Discret. Math., 2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

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

[BibT_eX]

[DOI]

Hao Li

Discret. Appl. Math., 2009

2007

Laplacian spectral bounds for clique and independence numbers of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Relative Length of Longest Paths and Cycles in Graphs.

[BibT_eX]

[DOI]

Siamak Pourabdillah-Nejed-D.

Graphs Comb., 2007

2006

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

[BibT_eX]

[DOI]

Lei Wang

Smita Savant-Bhonsale

Lian Li

Hassan Bagher-Ebadian

Karyn Alayne Ledbetter

Michael Chopp

NeuroImage, 2006

Trees of extremal connectivity index.

[BibT_eX]

[DOI]

Siamak Pourabdollah-Nejad D

Discret. Appl. Math., 2006

2005

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

[BibT_eX]

[DOI]

Hemanthkumar Athiraman

Michael Chopp

NeuroImage, 2005

Two sufficient conditions for dominating cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

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

[BibT_eX]

[DOI]

Katherine M. Chudoba

Eleanor Wynn

Mary Beth Watson-Manheim

Inf. Syst. J., 2005

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

[BibT_eX]

[DOI]

Graphs Comb., 2005

Fuzzy quadratic minimum spanning tree problem.

[BibT_eX]

[DOI]

Jinwu Gao

Appl. Math. Comput., 2005

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

[BibT_eX]

[DOI]

Charles H. House

Mary Beth Watson-Manheim

Tamar Matzkevich

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

2004

Neighborhood unions and cyclability of graphs.

[BibT_eX]

[DOI]

FengFeng Tian

Discret. Appl. Math., 2004

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

[BibT_eX]

[DOI]

Jinwu Gao

Linzhong Liu

Proceedings of the IEEE International Conference on Fuzzy Systems, 2004

2002

Hamiltonian cycles in 3-connected Claw-free graphs.

[BibT_eX]

[DOI]

Guojun Li

Zhenghong Liu

Discret. Math., 2002

2001

Cycles of length 1 modulo 3 in graph.

[BibT_eX]

[DOI]

Zhengguang Yu

Discret. Appl. Math., 2001

1999

Object-Oriented Requirements Modeling Based on UML.

[BibT_eX]

[DOI]

Xinpei Zhao

Mingshu Li

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.

[BibT_eX]

[DOI]

Hao Li

Zhiren Sun

Discret. Math., 1998

1997

Hamiltonicity of 2-connected claw-center independent graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1995

View-Based Techniques for Searching for Objects and Textures.

[BibT_eX]

[DOI]

Michael J. Swain

Charles H. Frankel