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…
Teresa Sousa
In this paper we consider the problem of finding the smallest number such that any graph G of order n admits a decomposition into edge disjoint copies of C 4 and single edges with at most elements. We solve this problem for n sufficiently large.
Sándor Szabó
Coloring the nodes of a graph is a commonly used technique to speed up clique search algorithms. Coloring the edges of the graph as a preconditioning method can also be used to speed up computations. In this paper we will show that an unconventional coloring…
Samir K. Vaidya, Udayan M. Prajapati
We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs C n , P n , and K 1,n are strongly prime graphs. Moreover we prove that W n…
Grant Andruchuk, Shonda Gosselin, Yizhe Zeng
We prove that a Cayley digraph on the direct product of dihedral groups D 2n × D 2m with outdegree two is Hamiltonian if and only if it is connected.
Anwar Alwardi, N.D. Soner, Ahmad N. Al-Kenani
Let G = ( V, E ) be a graph and A(G) is the collection of all minimal equitable dominating set of G . The middle equitable dominating graph of G is the graph denoted by M ed ( G ) with vertex set the disjoint union of V∪A(G) and ( u, v ) is an edge if and onl…
Wanzhou Ye, Zhao Liao
The generalized correlativity of input signal and output signal of a stack filtering operator is defined and used for numerously measuring these filtering operators's behavior in removing noise in signals. We show that under the criterion of the generalized c…
Samir K. Vaidya, Nirang J. Kothari
The domination integrity of a connected graph G = ( V ( G ), E ( G )) is denoted as DI ( G ) and defined by DI ( G ) = min {* S *+ m ( G-S ) : S is a dominating set } where m ( G-S ) is the order of a maximum component of G-S . We discuss domination integrity…
Krasimir Yordzhev
A formal-linguistic approach for solving an entertaining task is offered in this paper. The well-known task of the Hanoi towers is discussed in relation to some concepts of formal languages and grammars. A context-free grammar which generates an algorithm for…
Devadhas Nidha, Murugan Kala
The edge-domsaturation number ds'(G) of a graph G = (V, E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardinality k. In this paper, we characterize unicyclic graphs G with ds'(G) = q – Δ'(G) + 1 and investigate…
Reyhan Canatan
In this present paper, firstly, the modified positive operators and their discrete operators are constructed. Then, we investigate the statistical approximation properties and rates of convergence by using modulus of continuity of these positive linear operat…
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).