Write in a clean editor, then format for Discrete Mathematics Algorithms and Applications in one click — DocuGuru applies the official World Scientific template with superscript references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Discrete Mathematics Algorithms and Applications is a peer-reviewed journal published by World Scientific, covering Advanced Graph Theory Research, Graph Labeling and Dimension Problems, Graph theory and applications.
| Publisher | World Scientific |
|---|---|
| Reference style | Superscript numbered (World Scientific) Superscript — small raised numerals in the text 1. Smith, A., Jones, B. & Lee, C. A representative article title. Discrete Mathematics Algorithms and Applications 12, 45–58 (2023).
Formats any DOI in the closest standard style — Discrete Mathematics Algorithms and Applications has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Advanced Graph Theory Research Graph Labeling and Dimension Problems Graph theory and applications graph theory and CDMA systems Complexity and Algorithms in Graphs |
| ISSN | 1793-8309 |
| Citation impact (2-yr) | 0.43 |
| h-index | 27 |
| i10-index | 150 |
| Total citations | 5,529 |
| Top institutions publishing here | Manonmaniam Sundaranar University |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total [Formula: see text]-electron energy. But this topological index was not further studied…
Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually, the goal is…
Circulant graphs have been extensively investigated over the past 30 years because of their broad application to different fields of theory and practice. Two known surveys on circulant networks including a survey on undirected circulants have been published: by Bermond et al. [Distributed loop computer networks: A survey, J. Parallel Distributed Comput.24 (1995) 2–10] and…
Connected Dominating Set is widely used as virtual backbone in wireless networks to improve network performance and optimize routing protocols. Based on special characteristics of ad-hoc and sensor networks, we usually use unit disk graph to represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are said to…
Molodtsov [Soft set theory-first results, Comput. Math. App. 37 (1999) 19–31] proposed the concept of soft set theory in 1999, which can be used as a mathematical tool for dealing with problems that contain uncertainty. Shabir and Naz [On bipolar soft sets, preprint (2013), arXiv:1303.1344v1 [math.LO]] defined notion of bipolar soft set in 2013. In…
