Taoye Zhang

ORCID: 0000-0001-6092-6161
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Theory Research
  • Interconnection Networks and Systems
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Graph theory and applications
  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Finite Group Theory Research
  • Digital Image Processing Techniques
  • graph theory and CDMA systems
  • Electrohydrodynamics and Fluid Dynamics
  • Nanoparticle-Based Drug Delivery
  • Advanced Topics in Algebra
  • Microfluidic and Bio-sensing Technologies

West Virginia University
2022

Kutztown University
2022

Xinjiang University
2022

University of Scranton
2008-2022

Pennsylvania State University
2008-2022

Millersville University
2022

Wuhan University
2021

Morgantown High School
2007

10.1016/j.disc.2008.12.024 article EN publisher-specific-oa Discrete Mathematics 2009-01-21

The isolation and detection of rare circulating tumor cells (CTCs) from patient peripheral blood can help early diagnosis cancer evaluation therapeutic outcomes. At present, most the available strategies for enriching CTCs face serious problems with purity due to nonspecific interactions between capture medium leukocytes. Inspired by immune evasion ability homologous red (RBCs), we modified tumor-targeting molecule folic acid (FA) on surface RBCs hydrophobic interactions. Under treatment...

10.1021/acsami.1c05806 article EN ACS Applied Materials & Interfaces 2021-05-20

10.1016/j.disc.2007.11.008 article EN publisher-specific-oa Discrete Mathematics 2008-02-22

10.1016/j.jctb.2012.03.002 article EN publisher-specific-oa Journal of Combinatorial Theory Series B 2012-03-21

10.1016/j.disc.2019.06.006 article EN publisher-specific-oa Discrete Mathematics 2019-06-28

10.1016/j.ejc.2011.09.041 article EN publisher-specific-oa European Journal of Combinatorics 2011-10-26

10.1016/j.disc.2013.04.008 article EN publisher-specific-oa Discrete Mathematics 2013-05-03

For an integer s ≥ 0, G is s-hamiltonian-connected if for any vertex subset S ⊆ V (G) with |S| ≤ s, -S hamiltonian-connected.Thomassen in 1984 conjectured that every 4-connected line graph hamiltonian (see [Reflections on theory, J.

10.7151/dmgt.2448 article EN cc-by-nc-nd Discussiones Mathematicae Graph Theory 2022-01-01
Coming Soon ...