World's Best Scientists 2026 revealed!
Discrete Mathematics
H-index 12

Discrete Mathematics

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 190 84 185 12
Computer Science 648 56 104 8
Engineering and Technology 1095 19 41 6

Additional Metrics

Number of Best Scientists*: 123
Documents by Best Scientists*: 219
Top 100 Ranked Scientists*: 4
SCIMAGO H-index: 92
SCIMAGO SJR: 0.884
Impact Factor: 0.9

Overview

Top Research Topics at Discrete Mathematics?

The journal facilitates discussions on Combinatorics, Discrete mathematics, Graph, Conjecture and Chordal graph. It holds forums on Combinatorics that merges themes from other disciplines such as Upper and lower bounds and Order (group theory). Discrete mathematics studies presented in Discrete Mathematics focus on topics such as Graph power, Bound graph, Integer, Bipartite graph and Line graph.

Complement graph and Graph toughness are Graph power topics of special interest in the journal. Connectivity is a major topic of Graph research. The Chordal graph study tackled is a key component of adjacent topics in the area of Pathwidth.

  • Combinatorics (94.68%)
  • Discrete mathematics (91.77%)
  • Graph (18.04%)

What are the most cited papers published in the journal?

  • Unit disk graphs (1295 citations)
  • On the ratio of optimal integral and fractional covers (997 citations)
  • A characterization of the minimum cycle mean in a digraph (679 citations)

Research areas of the most cited articles at Discrete Mathematics:

The journal articles investigate studies in Combinatorics, Discrete mathematics, Graph, Chordal graph and Indifference graph. The published articles primarily discuss Combinatorics topics, particularly Conjecture, Pathwidth, Line graph, 1-planar graph and Neighbourhood (graph theory). The most cited papers connects the study in Discrete mathematics with the closely related areas of Upper and lower bounds.

What topics the last edition of the journal is best known for?

  • Combinatorics
  • Quantum mechanics
  • Algebra

The previous edition focused in particular on these issues:

Discrete Mathematics explores disciplines such as Discrete mathematics, Combinatorics, Degree (graph theory), Order (group theory) and Matrix (mathematics). Graph (abstract data type), Spectral radius, Type (model theory), Function (mathematics) and Upper and lower bounds are some topics wherein Discrete mathematics research discussed in Discrete Mathematics have an impact. The Combinatorics study featured in it draws connections with the study of Exponent.

While Degree (graph theory) is the focus of it, it also provided insights into the studies of Tree (set theory), Polytope, Tree (data structure), Partition (politics) and Chromatic scale. The Order (group theory) works featured in the journal incorporate elements from Direct product, Group (mathematics), Nilpotent, Bijection, injection and surjection and Sylow theorems. Discrete Mathematics explores issues in Matrix (mathematics) which can be linked to other research areas like Mathematical analysis, Unitary state, Eigenvalues and eigenvectors, Cayley graph and Corollary.

The most cited articles from the last journal are:

  • Contractible edges and liftable vertices in a 4-connected graph (0 citations)
  • The cone of quasi-semimetrics and exponent matrices of tiled orders (0 citations)
  • On unitary Cayley graphs of matrix rings (0 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Discrete Mathematics (based on the number of publications) are:

  • Michael A. Henning (104 papers) absent at the last edition,
  • Dieter Rautenbach (87 papers) absent at the last edition,
  • Lutz Volkmann (70 papers) absent at the last edition,
  • Hong-Jian Lai (65 papers) absent at the last edition,
  • Alexandr V. Kostochka (55 papers) published 1 paper at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Discrete Mathematics (based on the number of publications) are:

  • Hungarian Academy of Sciences (248 papers) absent at the last edition,
  • University of Waterloo (226 papers) published 2 papers at the last edition, 3 less than at the previous edition,
  • University of Paris (191 papers) absent at the last edition,
  • Massachusetts Institute of Technology (177 papers) absent at the last edition,
  • Centre national de la recherche scientifique (157 papers) absent at the last edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2022 edition, 60.00% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 22.22% were posted by at least one author from the top 10 institutions publishing in the journal. Another 0.00% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 11.11% of all publications and 66.67% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • On a rank-unimodality conjecture of Morier-Genoud and Ovsienko

    Thomas McConville;Bruce E. Sagan;Clifford Smyth

    (2021)
    29 Citations
  • Sampling hypergraphs with given degrees

    Martin E. Dyer;Catherine S. Greenhill;Pieter Kleer;James Ross

    (2021)
    21 Citations
  • Globally simple Heffter arrays H(n;k) when k≡0,3(mod4)

    Kevin Burrage;Kevin Burrage;Diane M. Donovan;Nicholas J. Cavenagh;Emine Sule Yazici

    (2020)
    18 Citations
  • Local metric dimension for graphs with small clique numbers

    (2022)
    16 Citations
  • Hypercellular graphs: Partial cubes without Q3− as partial cube minor

    Victor Chepoi;Kolja Knauer;Kolja Knauer;Tilen Marc;Tilen Marc

    (2020)
    16 Citations
  • On the eigenvalues of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e539" altimg="si16.svg"><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>α</mml:mi></mml:mrow></mml:msub></mml:math>-matrix of graphs

    (2020)
    15 Citations

Related Online Degrees & Career Pathways

For those interested in advancing their education in Computer Science, exploring easiest masters degree programs can be a practical approach. These programs often offer flexible schedules and manageable workloads, making it easier for working professionals to balance study and career growth.

For learners aiming higher, considering affordable doctoral programs is essential. You can find some of the most affordable doctoral programs online, which reduce financial barriers while providing advanced research opportunities in fields like computer science and information technology.

Financial aid plays a huge role in making education accessible. Many reputable online colleges that accept fafsa offer quality Computer Science degrees, helping students fund their education through federal student aid programs.

Additionally, online certificate programs present an excellent opportunity to gain specialized skills and boost earning potential quickly. Certificates in areas like cybersecurity, data science, and software development are highly valued by employers and complement formal degrees effectively.

Best Scientists Contributing to This Journal

Recently Published Articles