Discrete Applied Mathematics

Papers
(The H4-Index of Discrete Applied Mathematics is 18. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-06-01 to 2025-06-01.)
ArticleCitations
Security in Sierpiński graphs52
Editorial Board47
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]42
Independence, matching and packing coloring of the iterated Mycielskian of graphs39
Super graphs on groups, II37
Flow resistance to resistance ratios in cubic graphs35
On the chromatic number of graphs of odd girth without longer odd holes28
Solution to a problem of Katona on counting cliques of weighted graphs28
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size25
A new condition on dominated pair degree sum for a digraph to be supereulerian24
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes24
Bounded-degree light approximate shortest-path trees in doubling metrics23
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs23
Parameterized complexity for iterated type partitions and modular-width22
Erratum to “A rounding theorem for unique binary tomographic reconstruction” [Discrete Appl. Math. 268 (2019) 54–69]21
Wiener index and graphs, almost half of whose vertices satisfy Šoltés property20
Graphs with many edge-colorings such that complete graphs are rainbow19
Flip paths between lattice triangulations18
0.73724102973938