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…
P. Shanas Babu, A. V. Chithra
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The purpose of this paper is to derive exact values of acyclic chromatic number of some graphs.
Qinghong Wang, Jujuan Zhuang
Let G be a finite nilpotent group of odd order and S be a subset of G\{0} . We say that S is complete if every element of G can be represented as a sum of different elements of S and incomplete otherwise. In this paper, we obtain the characterization of large…
Tatyana Panyukova, Igor Alferov
The present research considers the problem of covering a graph with minimal number of trails satisfying the pre-defined local restrictions. The research is devoted to the problem of graph covering by minimal number of trails satisfying some local restrictions…
Ling Xue, Jianliang Wu
It is proved here that if a planar graph has maximum degree at least 6 and any 6-cycle contains at most one chord, then it is of class 1.
Blanca I. Niel
We single out the polygonal paths of n odd -1 order that solve each of the different longest non-cyclic Euclidean Hamiltonian path problems in networks by an arithmetic algorithm. As by product, the procedure determines the winding index of cyclic Hamiltonian…
Nilanjan De
The Zagrebeccentricity indices are the eccentricity version of the classical Zagrebindices. The first Zagrebeccentricity index ( E 1 ( G )) is defined as sum of squares of the eccentricities of the vertices and the second Zagrebeccentricity index ( E 2 ( G ))…
A. Vijayan, K. Lal Gipson
Let G = ( V , E ) be a simple graph. A set S í V is a dominating set of G , if every vertex in V - S is adjacent to at least one vertex in S . Let be the square of the Path and let denote the family of all dominating sets of with cardinality i . Let . In this…
Amanda M. Miller, David L. Farnsworth
The following theorem is proved : A knight ’ s tour exists on all 3 x n chessboards with one square removed unless : n is even, the removed square is ( i , j ) with i + j odd, n = 3 when any square other than the center square is removed, n = 5, n = 7 when an…
Wensheng Li
Let be a simple graph with vertex set V and edge set E. A function is said to be a reverse total signed vertex dominating function if for every , the sum of function values over v and the elements incident to v is less than zero. In this paper, we present som…
Guixin Deng
It is difficult to find Boolean functions achieving many good cryptographic properties. Recently, Tu and Deng obtained two classes of Boolean functions with good properties based on a combinatorial conjecture about binary strings. In this paper, using differe…
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).