Academic Journal
Q2Discrete Applied Mathematics
About Discrete Applied Mathematics
Discrete Applied Mathematics is a scholarly journal published by Elsevier B.V.. SCImago 2025 lists it in Q2, with an SJR of 0.656 and H-index of 99.
Coverage: 1979-2026. Research categories: Applied Mathematics (Q2); Discrete Mathematics and Combinatorics (Q2).
Source-backed journal facts
Topics in published research
Advanced Graph Theory Research; Graph Labeling and Dimension Problems; Graph theory and applications; Complexity and Algorithms in Graphs; Limits and Structures in Graph Theory; graph theory and CDMA systems.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
3,090.00 USD; 2,890.00 EUR; 2,470.00 GBP; 383,250.00 JPY
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
Toughness, k-factor and spectral radius of bipartite graphs
Shucheng Li, Yuanyuan Chen, Dan Li, Weihong Kong et al.
2027-01 · DOI: 10.1016/j.dam.2026.08.049Extremal trees with prescribed burning numbers
Eugene Jun Tong Leong, Kai An Sim, Wen Chean Teh
2027-01 · DOI: 10.1016/j.dam.2026.09.014A lower bound of the packing number of the 2-token graph of the cycle Cn
J.M. Gómez-Soto, L.M. Ríos-Castro
2027-01 · DOI: 10.1016/j.dam.2026.08.048On the total positivity of transformation matrices
Yanxin Liu, Jianxi Mao
2027-01 · DOI: 10.1016/j.dam.2026.09.029Perfect matchings and Aα-spectral radius in 1-binding graphs
Sizhong Zhou, Hongxia Liu
2027-01 · DOI: 10.1016/j.dam.2026.09.011Multiset metric dimension of binomial random graphs
Austin Eide, Paweł Prałat
2027-01 · DOI: 10.1016/j.dam.2026.09.010Tightening the girth bound for C(k,k) subdivisions in digraphs with minimum out-degree two
Bin Chen, Xinmin Hou, Yue Ma, Zhi Yin et al.
2027-01 · DOI: 10.1016/j.dam.2026.09.003Strength of the upper bounds for the Edge-Weighted Maximum Clique Problem
Fabio Ciccarelli, Valerio Dose, Fabio Furini, Marta Monaci et al.
2027-01 · DOI: 10.1016/j.dam.2026.09.019Proof of a conjecture on isolation of graphs with a universal vertex
Peter Borg, Alastair Farrugia
2027-01 · DOI: 10.1016/j.dam.2026.08.016Construction of sign k-potent sign patterns and conditions for such sign patterns to allow k-potence
Partha Rana, Sriparna Bandopadhyay
2027-01 · DOI: 10.1016/j.dam.2026.09.020K6-subdivisions in optimal 1-planar graphs
Atsunori Masuda, Yusuke Suzuki
2027-01 · DOI: 10.1016/j.dam.2026.09.023Complete solutions to spectral extremal problems on parity [a,b]-factors
Huicai Jia, Ting Xu, Ruifang Liu
2027-01 · DOI: 10.1016/j.dam.2026.08.036Balanced domination in convex polytopes, trees, and grid graphs
Bojan Nikolic, Marko Djukanovic
2027-01 · DOI: 10.1016/j.dam.2026.09.021The cyclic diagnosability of Cayley graphs generated by transposition triangle-free unicyclic graphs under the PMC and MM∗ models
Jialu Ding, Caixia Li, Pingshan Li, Wei Jin et al.
2027-01 · DOI: 10.1016/j.dam.2026.09.018Bollobás–Nikiforov conjecture holds asymptotically almost surely
Chunmeng Liu, Changjiang Bu
2027-01 · DOI: 10.1016/j.dam.2026.09.009Fractional hypergraph coloring
Margarita Akhmejanova, Sean Longbrake
2027-01 · DOI: 10.1016/j.dam.2026.09.008Algorithms on partial inverse min–max spanning tree problem under the l∞-norm
Qingzhen Dong, Xianyue Li
2027-01 · DOI: 10.1016/j.dam.2026.09.016Graphs of diameter three are recognizable
J. Antony Aravind, S. Monikandan
2027-01 · DOI: 10.1016/j.dam.2026.09.013Enumeration of polyominoes determined by Catalan words avoiding the consecutive pattern 012
Boualam Rezig, Moussa Ahmia
2027-01 · DOI: 10.1016/j.dam.2026.09.034Fan-type conditions involving the bipartite independence number for hamiltonicity and hamiltonian-connectedness in graphs
Hongxi Liu, Long-Tu Yuan, Xiaowen Zhang
2027-01 · DOI: 10.1016/j.dam.2026.08.047Reviews
Community Reviews
Version History
October 2, 2026 at 9:10 pm
October 2, 2026