Mohammad Javad Nikmehr

According to our database, Mohammad Javad Nikmehr authored at least 10 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Locally Recoverable Codes Over Z_p ^s.

Nasim Abdi Kourani, Hassan Khodaiemehr, Mohammad Javad Nikmehr

IEEE Trans. Commun., May, 2024

Coloring in essential annihilating-ideal graphs of commutative rings.

Reza Nikandish, M. Mehrara, Mohammad Javad Nikmehr

Soft Comput., January, 2024

List decoding of maximal order codes over number fields.

Nasim Abdi Kourani, Hassan Khodaiemehr, Mohammad Javad Nikmehr

Finite Fields Their Appl., January, 2024

2019

On the genus of essential graph of commutative rings.

K. Selvakumar, M. Subajini, Mohammad Javad Nikmehr

Australas. J Comb., 2019

2018

Perfectness of a graph associated with annihilating ideals of a ring.

V. Aghapouramin, Mohammad Javad Nikmehr

Discret. Math. Algorithms Appl., 2018

2017

On the strongly annihilating-ideal graph of a commutative ring.

N. Kh. Tohidi, Mohammad Javad Nikmehr, Reza Nikandish

Discret. Math. Algorithms Appl., 2017

2014

The M-principal graph of a commutative ring.

Mohammad Javad Nikmehr, Farideh Heydari

Period. Math. Hung., 2014

The Chromatic Index of a Graph Whose Core is a Cycle of Order at Most 13.

Saeed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr

Graphs Comb., 2014

2012

On the coloring of the annihilating-ideal graph of a commutative ring.

Ghodratollah Aalipour, Saieed Akbari, Reza Nikandish, Mohammad Javad Nikmehr, Farzad Shaveisi

Discret. Math., 2012

The Chromatic Index of a Graph Whose Core has Maximum Degree 2.

Mikio Kano, Saieed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr

Electron. J. Comb., 2012