ArticlesArchiveAboutEditorial BoardAuthor Guidelines
Call for papersThe 2026 special issue on Climate & Health is open for submissions.Learn more
Open Journal of Discrete Mathematics (OJDM) is an openly accessible journal published quarterly. The goal of this journal is to provide a platform for scientists and academicians all over the world to promote,share,and discuss various new issues and developments in different areas of discrete mathematics. All manuscri…
Roxanne Back, Alejandra Brewer Castano, Rachel Galindo, Jessica Finocchiaro
In the field of design theory, the most well-known design is a Steiner Triple System. In general, a G-design on H is an edge-disjoint decomposition of H into isomorphic copies of G. In a Steiner Triple system, a complete graph is decomposed into triangles. In…
Mohammad Hassan, Muhsin Al Hassan, Mazen Mostafa
Let G ( V , E ) be a finite connected simple graph with vertex set V ( G ). A function is a signed dominating function f : V ( G ) →{ − 1,1} if for every vertex v ∈ V ( G ), the sum of closed neighborhood weights of v is greater or equal to 1. The signe…
Sándor Szabó
In order to answer a question motivated by constructing substitution boxes in block ciphers we will exhibit an infinite family of full-rank factorizations of elementary 2-groups into two factors having equal sizes.
Charif Harrafa
In this article, we will present a particularly remarkable partitioning method of any infinite set with the aid of non-surjective injective maps. The non-surjective injective maps from an infinite set to itself constitute a semigroup for the law of compositio…
Viorel Nitica, Cem Ekinci
Motivated by their intrinsic interest and by applications to the study of numeric palindromes and other sequences of integers, we discover a method for producing infinite sets of solutions and almost solutions of the equation N ⋅ M = reversal ( N ⋅…
Isaac Reiter, Ju Zhou
Given a finite simple graph G , a set D ⊆ V ( G ) is called a dominating set if for all v ∈ V ( G ) , either v ∈ D or v is adjacent to some vertex in D . A dominating set D is independent if none of the vertices in D are adjacent, and D is perfect if ea…
Mohammad Hassan, Muhsin Al Hassan, Mazen Mostafa
Let G be a finite connected simple graph with vertex set V ( G ) and edge set E ( G ). A function f : V ( G ) → {1,1} is a signed dominating function if for every vertex v ∈ V ( G ) , the closed neighborhood of v contains more vertices with function values 1…
Paul A. Burchett
In this paper, both the roman domination number and the number of minimum roman dominating sets are found for any rectangular rook’s graph. In a similar fashion, the roman domination number and the number of minimum roman dominating sets are found on the squa…
Kevin K. H. Cheung, Patrick Girardet
Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approximating layout problems on random graphs, Discrete Mathematics , 235, 2001, 245-253), we show that several well-known graph layout problems are approximable to within a factor arbitrarily cl…
Mohammed M. Ali Al-Shamiri, Shokry I. Nada, Ashraf I. Elrokh, Yasser Elmshtaye
A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling that satisfies certain condition. In this p…
No articles in this issue.
Open Journal of Discrete Mathematics (OJDM) is an openly accessible journal published quarterly. The goal of this journal is to provide a platform for scientists and academicians all over the world to promote,share,and discuss various new issues and developments in different areas of discrete mathematics. All manuscri… All articles are open access under a CC BY 4.0 licence, with authors retaining copyright.
Authors submit their manuscript, metadata, and declarations through the portal. There is no submission fee.
The editorial office screens the manuscript for scope, completeness, and formatting before assigning a handling editor.
At least two independent reviewers evaluate the manuscript under single-blind review. Where revisions are required, authors respond point by point.
On acceptance the article processing charge is invoiced and the CC BY 4.0 copyright handover is signed.
The article is copyedited, typeset, and given a DOI, then publishes open access with a permanent link.
Manuscripts must be original and not under consideration elsewhere. Submit in Microsoft Word or LaTeX with figures at 300 dpi minimum. Structure research articles as Abstract, Introduction, Methods, Results, Discussion, and References.
Use the journal's numbered (Vancouver) reference style. Cite sources consecutively in the order they appear, and ensure every reference is complete and retrievable.
Declare all funding sources, conflicts of interest, and ethical approvals (including informed consent and animal-care statements where applicable).