Open Journal of Discrete Applied Mathematics (ODAM)

The aim of Open Journal of Discrete Applied Mathematics (ODAM) (2617-9687 Online, 2617-9679 Print) is to bring together research papers in different areas of algorithmic and applied mathematics as well as applications of mathematics in various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. To ensure fast publication, editorial decisions on acceptance or otherwise are taken within 4 to 12 weeks (three months) of receipt of the paper.

Accepted articles are immediately published online as soon as they are ready for publication. There is one volume containing three issues per year. The issues will be finalized in April, August, and December of every year. The printed version will be published in December of every year.

Latest Published Articles

Calculating degree-based topological indices and m-polynomials for various interconnection networks

ODAM-Vol. 7 (2024), Issue 1, pp. 21 – 38 Open Access Full-Text PDF
Noha Mohammad Seyam, Mohammed Ali Alghamdi and Adnan Khalil

Abstract: There are three different kinds of topological indices: spectrum-based, degree-based, and distance-based. We presented the \(K\)-swapped network for \(t\)-regular graphs in this study. We also computed various degree-based topological indices of the \(K\)-swapped network for \(t\)-regular graphs, eye, and \(n\)-dimensional twisted cube network. The metrics used to analyze the abstract structural characteristics of networks are called topological indices. We also calculate each of the aforementioned networks M-polynomials. A graph can be used to depict an interconnection network’s structure. The processing nodes in the network are represented by vertices, while the links connecting the processor nodes are represented by edges. We can quickly determine the diameter and degree between the nodes based on the graph’s topology. A key component of graph theory are graph invariants, which identify the structural characteristics of networks and graphs. Furthermore described by graph invariants are computer, social, and internet networks.

Read Full Article

Edge hub number of fuzzy graphs

ODAM-Vol. 7 (2024), Issue 1, pp. 11 – 20 Open Access Full-Text PDF
Saad Tobaili, Haifa Ahmed and Mohammed Alsharafi

Abstract: Shadi I.K et al. [1] introduced the edge hub number of graphs. This work extends the concept to fuzzy graphs. We derive several properties of edge hub number of fuzzy graphs and establish some relations that connect the new parameter with other fuzzy graph parameters. Also, some bounds of such a parameter are investigated. Moreover, we provide empirical evidence examples to elucidate the behavior and implications of edge hub number of fuzzy graph parameters.

Read Full Article

Covering and 2-degree-packing numbers in graphs

ODAM-Vol. 7 (2024), Issue 1, pp. 1 – 10 Open Access Full-Text PDF
Carlos A. Alfaro, Christian Rubio-Montiel and Adrián Vázquez Ávila

Abstract: In this paper, we give a relationship between the covering number of a simple graph \(G\), \(\beta(G)\), and a new parameter associated to \(G\), which is called 2-degree-packing number of \(G\), \(\nu_2(G)\). We prove that \[\lceil \nu_{2}(G)/2\rceil\leq\beta(G)\leq\nu_2(G)-1,\] for any simple graph \(G\), with \(|E(G)|>\nu_2(G)\). Also, we give a characterization of connected graphs that attain the equalities.

Read Full Article

Chromatically unique \(6\)-bridge graph \(\theta (r,r,s,s,t,u)\)

ODAM-Vol. 6 (2023), Issue 3, pp. 41 – 56 Open Access Full-Text PDF
Syed Ahtsham Ul Haq Bokhary and Shehr Bano

Abstract: Let \(A\) and \(B\) be two graph and \(P(A,z)\) and \(P(B,z)\) are their chromatic polynomial, respectively. The two graphs \(A\) and \(B\) are said to be chromatic equivalent denoted by \( A \sim B \) if \(P(A,z)=P(B,z)\). A graph \(A\) is said to be chromatically unique(or simply \(\chi\)- unique) if for any graph \(B\) such that \(A\sim B \), we have \(A\cong B\), that is \(A\) is isomorphic to \(B\). In this paper, the chromatic uniqueness of a new family of \(6\)-bridge graph \(\theta(r,r,s,s,t,u)\) where \(2\leq r\leq s \leq t\leq u\) is investigated.

Read Full Article

Connectivity indices and QSPR analysis of benzenoid hydrocarbons

ODAM-Vol. 6 (2023), Issue 3, pp. 35 – 40 Open Access Full-Text PDF
Zhen Lin

Abstract: In mathematical chemistry, a large number of topological indices are used to predict the physicochemical properties of compounds, especially in the study of quantitative structure-proerty relationship (QSPR).
However, many topological indices have almost the same predictive ability. In this paper, we focus on how to use fewer topological indices to predict the physicochemical properties of compounds through the QSPR analysis of connectivity indices of benzene hydrocarbons.

Read Full Article

The aim of Open Journal of Discrete Applied Mathematics (ODAM) is to publish research papers in

  • Combinatorics applied commutative algebra
  • Discrete mathematics
  • Theoretical computer science
  • Difference equations
  • Matrices
  • Fuzzy theory
  • Matroid theory
  • Graph algorithm
  • Coding theory
  • Graph theory
  • Numerical analysis
  • Dynamical systems
  • Optimization
  • Statistical theory
  • Mathematical methods in applied sciences
  • Operations research
  • Computing

We publish three issues in a year.

There is no article processing or publication charges. This journal is free for both authors and readers.

ISSN 2617-9687 (online)

ISSN 2617-9679 (Print)

Key title: Open Journal of Discrete Applied Mathematics

Abbreviated key title: Open J. Discret. Appl. Math.

Parallel title: ODAM

Editor in Chief

Ivan Gutman

University of Kragujevac, Kragujevac, Serbia
State University Novi Pazar, Novi Pazar, Serbia

Co-Editor in Chief

Naveed Akhter

Punjab Higher Education Department, Lahore, Pakistan.

Managing Editor

Muhammad Kamran Jamil

Riphah International University, Lahore, Pakistan
Email: odam@pisrt.org

Associated Editor’s

Ioan Tomescu

University of Bucharest, Bucharest, Romania

Kinkar Chandra Das

Sungkyunkwan University, Suwon, Republic of Korea   

Xueliang Li

Center for combinatorics and LPMC-TJKLC, Nankai University, Tianjin, China

Dumitru Baleanu

Cankaya University, Ankara, Turkey & Institute of Space Sciences, Magurele, Bucharest, Romaina

Abdul Khaliq
Riphah International University, Lahore, Pakistan

Juan Alberto Rodríguez Velázquez

Departament d’Enginyeria Informàtica i Matemàtiques, Tarragona, Spain

Tomas Vetrik

University of the free state Bloemfontein, Republic of South Africa

Zhibin Du

Zhaoqing University, China

Jeno Lehel

Alfred Renyi Institute of Mathematics, Hungary

Roslan Hasni @ Abdullah

Faculty of Ocean Engineering Technology and Informatics, Universiti Malaysia Terengganu,
21030 Kuala Nerus, Terengganu, Malaysia

Shaohui Wang

Savannah State University, Georgia

Pierpaolo D’Urso

Sapienza, University of Rome, P.le Aldo Moro, 5, 00185 ROMA, ITALY

Mehdi Alaeiyan

Iran University of Science and Technology, Iran

Shuchao Li

Central China Normal University, China.

Akinola Abolape Deborah

University of Agriculture, Makurdi, Nigeria.

Ali Ahmad
Jazan University, Saudi Arabia

Kashif Ali

COMSATS University, Pakistan

Muhammad Imran

United Arab Emirates University, United Arab Emirates

Sudev Naduvath

Christ University, India

Faisal Nadeem

COMSATS University, Pakistan

Akhlaq Ahmad Bhatti

National University of Computer and Emerging Sciences, Pakistan

Muhammad Kamran Siddiqui

COMSATS University, Pakistan

Muhammad Nauman

COMSATS University, Pakistan

Florentin Smarandache

University of New Mexico, 705 Gurley Ave., Gallup, New Mexico 87301, US

Tahir Mahmood

Department of Mathematics and Statistics, International Islamic University Islamabad, Pakistan

A. Borumand Saeid

Department of Mathematics, Shahid Bahonar university of Kerman, Kerman, Iran

Mustapha Aouchiche

United Arab Emirates University, United Arab Emirates

Gerhard-Wilhelm Weber

Poznan University of Technology, Poznan, Poland

Hamid Reza Karimi

Department of Mechanical Engineering, via La Masa 1, 20156 Milan, Italy

Martin Bohner

Missouri University of Science and Technology, USA

Miklós Krész

University of Szeged, Hungary

Muhammad Azeem

Department of Mathematics, Riphah International University, Lahore

The contents of the Open Journal of Mathematical Analysis can be downloaded free from the website and for the print copy of the journal the charges are 550USD.

Articles should be sent (by e-mail) to the Managing Editor (odam@pisrt.org).