Publish with us
Search for Articles:

Information Menu

Journal Browser

View All

Open Journal of Discrete Applied Mathematics (ODAM)

Open Journal of Discrete Applied Mathematics (ODAM), ISSN: 2617-9687 (Online), 2617-9679 (Print), is an international, peer-reviewed, Diamond Open Access journal dedicated to publishing research in algorithmic mathematics, discrete applied mathematics, and the applications of mathematics across science and technology. The journal welcomes research articles, short notes, survey articles, and well-formulated research problems that contribute to the advancement of knowledge in discrete and applied mathematics.

  • Diamond Open Access: ODAM follows the Diamond Open Access publishing model, under which published articles are freely available online to readers, and authors are not required to pay article processing charges for standard publication.
  • Visibility: Accepted articles are published online as soon as they are ready for publication, ensuring broad accessibility and timely dissemination. A printed version is released annually in December.
  • Rapid Publication: Editorial decisions regarding acceptance, revision, or rejection are normally provided within 4 to 12 weeks, or three months, after receipt of the manuscript, with accepted articles published online promptly after final preparation.
  • Scope: The journal focuses on algorithmic mathematics, discrete applied mathematics, and applications of mathematics in science and technology. It considers research papers, short notes, survey articles, and research problems.
  • Publication Frequency: One volume with three issues is published annually, in April, August, and December, with the printed version released in December.
  • Indexing: ROAD, Mathematical Reviews (MathSciNet), WorldCat, Scilit, and Google Scholar.
  • Publisher: Ptolemy Scientific Research Press (PSR Press), part of the Ptolemy Institute of Scientific Research and Technology.

Latest Published Articles

Download PDF

Zero-Sum Flow Number of Some Grid Graphs

Muhammad Kamran Siddiqui1, Muhammad Naeem 2, Muhammad Imran3,4
1Department of Mathematics, COMSATS University Islamabad, Sahiwal Campus, Pakistan.
2Department of Mathematics, The University of Lahore, Pakpattan Campus, Pakistan.
3Department of Mathematics, Department of Mathematical Sciences, United Arab Emirates University, Al Ain, United Arab Emirates
4Department of Matheamtics, School of Natural Sciences (SNS), National University of Science and Technology, Islamabad, Pakistan.
Abstract:

For an undirected graph \(G\), a zero-sum flow is an assignment of nonzero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum \(k\)-flow if the absolute values of edges are less than \(k\). We define the zero-sum flow number of \(G\) as the least integer \(k\) for which \(G\) admitting a zero sum \(k\)-flow. In this paper we gave complete zero-sum flow and zero sum number for octagonal grid, generalized prism and book graph.

Full Article
Download PDF

Degree Subtraction Adjacency Eigenvalues and Energy of Graphs Obtained From Regular Graphs

Harishchandra S. Ramane1, Hemaraddi N. Maraddi1
1Department of Mathematics, Karnatak University, Dharwad-580003, India.
Abstract:

Let \(V(G) = \{v_1, v_2, \ldots, v_n\}\) be the vertex set of \(G\) and let \(d_{G}(v_i)\) be the degree of a vertex \(v_i\) in \(G\). The degree subtraction adjacency matrix of \(G\) is a square matrix \(DSA(G)=[d_{ij}]\), in which \(d_{ij}=d_{G}(v_i)-d_{G}(v_j)\), if \(v_i\) is adjacent to \(v_j\) and \(d_{ij}=0\), otherwise. In this paper we express the eigenvalues of the degree subtraction adjacency matrix of subdivision graph, semitotal point graph, semitotal line graph and total graph of a regular graph in terms of the adjacency eigenvalues of \(G\). Further we obtain the degree subtraction adjacency energy of these graphs.

Full Article
Download PDF

A Note on the Zeroth-order General Randić Index of Polygonal Cacti

Jiachang Ye1, Yuedan Yao2
1Department of Mathematics, South China Agricultural University, Guangzhou, China
2Department of Mathematics, South China Agricultural University, Guangzhou, China.
Abstract:

The zeroth-order general Randić index of a simple connected graph G is defined as \(R_{\alpha}^{0}(G)=\sum_{u\in V(G)} \big(d(u)\big)^{\alpha}\), where \(d(u)\) is the degree of \(u\) and \(\alpha\not\in \{0,1\}\) is a real number. A \(k\)-polygonal cactus is a connected graph in which every edge lies in exactly one cycle of length \(k\). In this paper, we present the extremal \(k\)-polygonal cactus with \(n\) cycles for \(k\geq3\) with respect to the zeroth-order general Randić index.

Full Article
Submit Manuscript
Open Journal of Discrete Applied-Mathematics - ODAM Cover

Special Issues

The PSR Press Office warmly invites scholars, researchers, and experts to propose and guest edit Special Issues on topics of significance to the scientific community.

Read more

Propose a Special Issue

News