Special Issue: Graph Theory and Discrete Optimization
Guest Editors
Prof. Dong Ye
Department of Mathematical Sciences and Center for Computational & Data Science, Middle Tennessee State University, United States of America
Email: dong.ye@mtsu.edu
Prof. Yujun Yang
Department of Mathematics and Information Sciences, Yantai University, China
Email: yangyj@ytu.edu.cn
Manuscript Topics
Graph theory and discrete optimization remain foundational areas within contemporary mathematics, supporting advances in algorithmic design, network analysis, combinatorial structures, and computational complexity. As interest grows in rigorous approaches to both the theoretical study of discrete structures and the practical implementation of graph theoretic and optimization techniques, the interaction between these fields continues to gain importance.
This special issue of AIMS Mathematics welcomes high quality submissions that contribute to the development of fundamental theory, propose novel optimization methodologies, or reveal meaningful connections across related domains. Through this collection, we aim to present a broad range of perspectives that reflect current progress and foster further development in graph theory and discrete optimization.
The scope includes, but is not limited to, the following areas:
• Graph Theory
• Extremal Combinatorics
• Probabilistic Methods in Discrete Structures
• Combinatorial Optimization
• Discrete Algorithms
• Randomized Algorithms
• Algorithmic Complexity
• Complex Networks
• Applications of Graph Theory in Biology and Chemistry
Instructions for authors
https://www.aimspress.com/math/news/solo-detail/instructionsforauthors
Please submit your manuscript to online submission system
https://aimspress.jams.pub/
Paper Submission
All manuscripts will be peer-reviewed before their acceptance for publication. The deadline for manuscript submission is 31 October 2026
Abstract
HTML
PDF