A5041265547- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- graph theory and CDMA systems
- Limits and Structures in Graph Theory
- Complex Network Analysis Techniques
- Opinion Dynamics and Social Influence
- Computational Geometry and Mesh Generation
- Interconnection Networks and Systems
- Graph theory and applications
- Evolutionary Game Theory and Cooperation
- Mental Health Research Topics
- Engineering Structural Analysis Methods
- Peer-to-Peer Network Technologies
- Structural Load-Bearing Analysis
- Optimization and Search Problems
- Advanced Graph Neural Networks
- Mechanical stress and fatigue analysis
- Economic theories and models
- Complexity and Algorithms in Graphs
- Vehicle emissions and performance
- Complex Systems and Decision Making
- Evolution and Genetic Dynamics
- Merger and Competition Analysis
- Functional Brain Connectivity Studies
- Bioinformatics and Genomic Networks
Shandong University
2015-2024
Zaozhuang University
2018
Changji University
2018
Michigan State University
2018
Inner Mongolia Normal University
2014
Hetao College
2014
Fujian University of Technology
2013
Chang'an University
2010
Chongqing University
2009
BC Innovation Council
2002
ObjectiveInflammatory bowel disease (IBD) refers to the chronic inflammation of gastrointestinal tract and includes diseases such as Crohn’s Disease (CD) Ulcerative Colitis (UC). Oncostatin M Receptor (OSMR) Interlukin -11 (IL11) are two targets identified potentially inhibit pro-inflammatory glycoprotein 130 (g130) signaling. Experimentally defining best-in-class properties potential therapeutic antibodies early in program is challenging due large parameter space that must be assessed....
Abstract The linear arboricity of a graph G is the minimum number forests which partition edges . Akiyama et al. conjectured that $\lceil {\Delta {({G})}\over {2}}\rceil \leq {la}({G}) \lceil {\Delta({G})+{1}\over {2}}\rceil$ for any simple Wu wu proved conjecture planar maximum degree $\Delta\not={{7}}$ It noted here also true $\Delta={{7}}$ © 2008 Wiley Periodicals, Inc. J Graph Theory 58:210‐220,
Abstract A proper edge coloring of a graph G is called acyclic if there no 2‐colored cycle in . The chromatic number , denoted by χ ( ), the least colors an In this paper, we determine completely outerplanar graphs. proof constructive and supplies polynomial time algorithm to acyclically color edges any using ) colors. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 22–36, 2010
The linear arboricity la(G) of a graph G is the minimum number forests that partition edges G. In 1984, Akiyama et al. stated Linear Arboricity Conjecture (LAC), any simple maximum degree $\Delta$ either $\lceil \tfrac{\Delta}{2} \rceil$ or \tfrac{\Delta+1}{2} \rceil$. [J. L. Wu. On planar graphs. J. Graph Theory, 31:129-134, 1999] and Wu Y. W. graphs seven four. 58(3):210-220, 2008.] it was proven LAC holds for all implies odd, ${\rm la}(G)=\big \lceil \big We conjecture this equality true...