Discrete Applied Mathematics
| 短名 | Discrete. Appl. Math. |
| Journal Impact | 1.00 |
| 国际分区 | MATHEMATICS, APPLIED(Q3) |
| 期刊索引 | SCI Q3中科院 3 区 |
| ISSN | 0166-218X, 1872-6771 |
| h-index | 94 |
| 国内分区 | 数学(3区)数学应用数学(3区) |
离散应用数学的目的是汇集算法和适用离散数学的不同领域的研究论文，以及组合数学在信息学和科学技术的各个领域的应用。提交给期刊的投稿可以是研究论文、简短笔记、调查，也可能是研究问题。 “通讯”部分将致力于以最快的速度出版最近的研究成果，这些成果经过编辑委员会成员的检查和推荐出版。该杂志还将出版数量有限的图书公告以及会议论文集。这些程序将得到充分的参考，并遵守期刊的正常标准。建议潜在作者在提交稿件之前查看期刊和特刊的公开征集论文。只有在期刊或目标特刊范围内的高质量原创作品才会被考虑。
期刊主页投稿网址| 涉及主题 | 数学组合数学计算机科学离散数学理论计算机科学图形算法数学分析程序设计语言物理工程类几何学哲学顶点（图论）数学优化 |
| 出版信息 | 出版商: Elsevier B.V.，出版周期: Monthly，期刊类型: journal |
| 基本数据 | 创刊年份: 1979，原创研究文献占比: 100.00%，自引率:10.00%， Gold OA占比: 16.45% |
| 平均审稿周期 | 网友分享经验：一般,3-6周来源Elsevier官网：平均29.7周 |
| 平均录用比例 | 网友分享经验：容易 |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
On two open problems on the normality of bent functions
2025-1-1
The generalized 4-connectivity of burnt pancake graphs
2025-1-1
Some results on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e44" altimg="si18.svg"><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:mi>i</mml:mi><mml:mo linebreak="goodbreak" linebreakstyle="…
2025-1-1
On interval colouring reorientation number of oriented graphs
2025-1-1
Every 2-connected {claw, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e114" altimg="si81.svg"><mml:msub><mml:mrow><mml:mi>Z</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>}-free graph with minimum degree at least 4 contains two CISTs
2025-1-1
Semi-proper interval graphs
2025-1-1
On locally finite ordered rooted trees and their rooted subtrees
2025-1-1
Shapley–Folkman-type theorem for integrally convex sets
2025-1-1
On semi-transitivity of (extended) Mycielski graphs
2024-12-1
Directed cycle <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e176" altimg="si29.svg"><mml:mi>k</mml:mi></mml:math>-connectivity of complete digraphs and complete regular bipartite digraphs
2024-12-1
On b-greedy colourings and z-colourings
2024-12-1
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs
2024-12-1
Note on the eccentricity spectral radius of uniform hypertrees with given diameter
2024-12-1
Chromatic numbers for facet colouring of some generalised associahedra
2024-12-1
Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
2024-12-1
On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e19" altimg="si32.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-chromatic numbers of graphs with bounded sparsity parameters
2024-12-1
On locating and neighbor-locating colorings of sparse graphs
2024-12-1
Squares of graphs are optimally <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e19" altimg="si25.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-supereulerian
2024-12-1
Two classes of 1-resilient semi-bent functions based on disjoint linear codes
2024-12-1
Independence number and minimum degree for path-factor critical uniform graphs
2024-12-1
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
2024-12-1
The weighted Mostar index of cacti
2024-12-1
A quick way to verify if a graph is 3-colorable
2024-12-1
Total-rainbow connection and forbidden subgraphs
2024-12-1
A characterization of graphs with given total coalition numbers
2024-12-1
On the 2-spanning cyclability of honeycomb toroidal graphs
2024-12-1
Dot product dimension of unicyclic graphs
2024-12-1
Integer orbits in rectangular lattice billiards
2024-12-1
On the total version of the covering Italian domination problem
2024-12-1
Mutual-visibility in strong products of graphs via total mutual-visibility
2024-12-1
Editorial Board
2024-12-1
Synchronizing dynamic Huffman codes
2024-12-1
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
2024-12-1
On the rainbow planar Turán number of double stars
2024-12-1
Spanning connectivity of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e38" altimg="si42.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math>-free split graphs
2024-12-1
Relaxation of Wegner’s planar graph conjecture for maximum degree 4
2024-12-1
Screw discrete dynamical systems and their applications to exact slow NIM
2024-12-1
The proper 2-connection number of several graph classes
2024-12-1
Maxima of the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e35" altimg="si14.svg"><mml:mi>Q</mml:mi></mml:math>-index for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e40" altimg="si15.svg"><mml:mrow><mml:mn>3</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math>-free graphs
2024-12-1
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e41" altimg="si7.svg"><mml:msup><mml:mrow/><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>-connected medians
2024-12-1
Spectra of total graphs
2024-12-1
Finding <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e465" altimg="si11.svg"><mml:mi>k</mml:mi></mml:math>-community structures in special graph classes
2024-12-1
Graphs with degree sequence <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e247" altimg="si7.svg"><mml:mrow><mml:mo>{</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow…
2024-12-1
Eccentricity matrix of corona of two graphs
2024-12-1
Computational complexity of covering disconnected multigraphs
2024-12-1
The weighted total cophenetic index: A novel balance index for phylogenetic networks
2024-12-1
Polyhedral approach to weighted connected matchings in general graphs
2024-12-1
A note on Hamilton <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e432" altimg="si28.svg"><mml:mi>ℓ</mml:mi></mml:math>-cycle decomposition of complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e437" altimg="si29.svg"><mml:mi>k</mml:mi></mml:math>-partite hypergraphs
2024-12-1
Algorithmic results for weak Roman domination problem in graphs
2024-12-1
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
2024-12-1
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远