Exploration of Graph Theory and Discrete Optimization

Dear Colleagues,

Graph theory is a fundamental domain of discrete mathematics, characterized by its rich axiomatic structure and its ability to formalize relations, interactions, and discrete phenomena.

Since its origins in the 18th century, graph theory has been a branch of mathematics that is both motivated by and applied to real-world problems. Research in discrete mathematics increased in the latter half of the twentieth century, mainly due to the development of digital computers.

Recently, advances in the technology of digital computers have enabled extensive application of new ideas from discrete mathematics to real-world problems.

Over the past few decades, the field has experienced substantial growth, driven by the development of new theoretical concepts as well as the increasing demand for mathematically sound models in science, engineering, and technology.

Contributions introducing new definitions, invariants, methods, or general frameworks are particularly welcome, as are studies that deepen the theoretical understanding of existing concepts.

At the same time, papers demonstrating how solid mathematical foundations lead to meaningful applications are equally encouraged. Original research articles and high-quality review papers are invited on all aspects of graph theory and related discrete structures. Topics of interest include, but are not limited to, structural and extremal properties of graphs, graph invariants and polynomials, distance-based measures, stability and robustness of graph properties, graph operations and products, algorithmic aspects, and mathematically grounded applications of graph theory in applied sciences.  

Prof. Dr. Janez Žerovnik
Dr. Darja Rupnik Poklukar
Topic Editors