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…
Vardges Melkonian
We consider a variation of the maximum bipartite matching problem where each completed task must have at least two agents assigned to it. We give an integer programming formulation for the problem, and prove that the basic solutions of LP-relaxation are half-…
Sandy H. L. Chen
For every partition and its conjugation , there is an important invariant , which denotes the number of different parts. That is , . We will derive a series of symmetric q -identities from the invariant in partition conjugation by studying modified Durfee rec…
Davoud Jelodar, Dara Moazzami
A new lower bound on the tenacity of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and other well-known graphical parameters are considered, and another formulation introduced from furth…
Ramadan El-Shanawany, Hanan Shabana
An orthogonal double cover (ODC) of a graph H is a collection of subgraphs (pages) of H , so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC G of H is cyclic (CODC) if the cyclic group of order i…
Carlos D’ Andrea, Emiliano Gómez
Games often provide a good introduction to interesting phenomena in mathematics. In this note, we examine three variations of an iterative sharing game played around a circular (or not so circular) table. More precisely, for each variation , we study the tend…
Chuanlong Wang, Mudaster Sidik, Xuerong Yong
In this note , we show that the number of digraphs with n vertices and with cycles of length k , 0 ≤ k ≤ n , is equal to the number of n × n (0,1) -matrices whose eigenvalues are the collection of copies of the entire k th unit roots plus, possibly, 0’s. In p…
Maodong Ye
Using the linear space over the binary field that related to a graph G , a sufficient and necessary condition for the chromatic number of G is obtained.
Pete L. Clark
We introduce the notion of a graph derangement, which naturally interpolates between perfect matchings and Hamilto nian cycles. We give a necessary and sufficient condition for the existence of graph derangements on a locally finite graph. This result was fir…
Paul Feit
Gravier et al . established bounds on the size of a minimal totally dominant subset for graphs P k □ P m . This paper offers an alternative calculation, based on the following lemma: Let so k≥3 and r≥2 . Let H be an r - regular finite graph, and put G=P k □ H…
Mark J. Nielsen, William Webb
A crossing family of segments is a collection of segments each pair of which crosses. Given positive integers j and k,a (j,k) grid is the union of two pairwise-disjoint collections of segments (with j and k members, respectively) such that each segment in the…
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).