Back to Top

Advances and Applications in Discrete Mathematics (AADM)

Publisher :

Pushpa Publishing House

Scopus Profile
Peer reviewed only
Scopus Profile
Open Access
  • Mathematics
Issue Frequency :

8-issues-year

p-ISSN :

0974-1658

Est. Year :

2008

Mobile :

9554566665

DOI :

YES

Country :

India

Language :

English

APC :

YES

Impact Factor Assignee :

Google Scholar

Email :

aadm@pphmj.com

Journal Descriptions

The Advances and Applications in Discrete Mathematics is a peer-reviewed open-access journal devoted to the publication of original research articles lying within the domain of Discrete Mathematics and Combinatorics which includes graphs, hypergraphs, logic, coding theory and block design. The journal encourages articles in these areas having efficient and powerful tools for applications in the real world problems related to discrete geometry, discrete probability theory, networking and information sciences. Newer upcoming topics are also promoted. Expository articles pinpointed towards certain development of current interest in discrete mathematics are welcome. The topics related to this journal include but are not limited to: Graph theory, hypergraph theory, enumeration, coding theory, block designs, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, discrete probability theory, discrete calculus, discrete probability distributions, discrete morse theory, discrete vector measures, discrete dynamical systems, discrete logarithms, discrete modelling. The journal is indexed in ESCI (Emerging Sources Citation Index) and Zentralblatt MATH, among other highly recognised indexes further enhancing its visibility and recognition in the field.


Advances and Applications in Discrete Mathematics (AADM) is :

International, Peer-Reviewed, Open Access, Refereed, Mathematics , Print, 8-issues-year Journal

UGC Approved, ISSN Approved: P-ISSN - 0974-1658, E-ISSN , Established in - 2008, Impact Factor

Provide Crossref DOI

Not indexed in Scopus, WoS, DOAJ, PubMed, UGC CARE

Publications of AADM

Research Article
  • dott image January, 2018

FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH

Let G be a connected graph. Given any two vertices u and v of G, the set ID[ ] u, consists of all those vertices lying on a longest v u-v path. A set S is a detour convex set if ID[u, for v]...

Establish Your Own Journal Without the Expense!

OJSCloud offers a complete, free setup to get you publishing.

Start Your Free Journal!
free profile