Advances in Graph Theory, Combinatorics, and Applications

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "A: Algebra and Logic".

Deadline for manuscript submissions: 31 May 2026 | Viewed by 1400

Special Issue Editor


E-Mail Website
Guest Editor
Department of Mathematics, Faculty of Science, Khon Kaen University, Khon Kaen 40002, Thailand
Interests: graph theory; machine learning

Special Issue Information

Dear Colleagues,

Graph theory and combinatorics are two of the most diverse and prolific fields in mathematics, with elegant theoretical aspects and real-world applications. This Special Issue aims to highlight recent advances in classical and emerging areas in graph theory, including graph coloring and labeling, algebraic and structural graph theory, extremal and distance problems, random graph theory, and topological indices of graphs.

We also welcome contributions in combinatorial theory and applications in complex networks. The interdisciplinary papers bridging theoretical aspects of discrete mathematics with various interdisciplinary sciences such as computer science, data analysis, and applied sciences are also encouraged.

We warmly invite researchers to submit original articles that advance our understanding of discrete structures and their growing influence across disciplines.

Dr. Kittikorn Nakprasit
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • graph theory
  • graph coloring
  • graph labeling
  • algebraic graph theory
  • structural graph theory
  • extremal graphs/digraphs
  • random graph theory
  • distance
  • topological indices
  • combinatorics
  • combinatorial theory
  • complex networks

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

12 pages, 311 KB  
Article
Bounds on the Domination Numbers of δ-Complement Graphs
by Wipawee Tangjai, Chayapa Darayon, Panupong Vichitkunakorn, Rasimate Maungchang and Witsarut Pho-on
Mathematics 2026, 14(4), 734; https://doi.org/10.3390/math14040734 - 22 Feb 2026
Viewed by 486
Abstract
This study examines the δ-complements of graphs—a specific type of graph complement whose adjacency depends on the adjacency of the vertices with identical degrees in the original graph. More specifically, we study this type of complement regarding the domination number. We provide [...] Read more.
This study examines the δ-complements of graphs—a specific type of graph complement whose adjacency depends on the adjacency of the vertices with identical degrees in the original graph. More specifically, we study this type of complement regarding the domination number. We provide sharp Nordhaus–Gaddum-type bounds on the domination number of a graph and its δ-complement. We also provide sharp bounds on the domination numbers of the δ-complements of joined graphs and Cartesian product graphs. Full article
(This article belongs to the Special Issue Advances in Graph Theory, Combinatorics, and Applications)
Show Figures

Figure 1

Back to TopTop