Mohammad Hadi Shekarriz

According to our database, Mohammad Hadi Shekarriz authored at least 9 papers between 2017 and 2026.

Collaborative distances:

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

2026

An Intelligent Hybrid Cross-Entropy System for Maximising Network Homophily via Soft Happy Colouring.

Mohammad Hadi Shekarriz, Asef Nazari, Dhananjay R. Thiruvady

CoRR, March, 2026

2025

Enhancing Soft Happiness via Evolutionary Algorithms.

Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari

CoRR, August, 2025

Local Search Improvements for Soft Happy Colouring.

Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Wilfried Imrich

CoRR, June, 2025

Soft happy colourings and community structure of networks.

Mohammad Hadi Shekarriz, Dhananjay R. Thiruvady, Asef Nazari, Rhyd Lewis

Comput. Oper. Res., 2025

2023

Distinguishing threshold of graphs.

Mohammad Hadi Shekarriz, Bahman Ahmadi, S. A. Talebpour, Mohammad Hassan Shirdareh Haghighi

J. Graph Theory, June, 2023

2022

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring.

Saeid Alikhani, Mohammad Hadi Shekarriz

Art Discret. Appl. Math., December, 2022

2020

Number of distinguishing colorings and partitions.

Bahman Ahmadi, Fatemeh Alinaghipour, Mohammad Hadi Shekarriz

Discret. Math., 2020

2018

A characterization for 2-self-centered graphs.

Kamyar Mirzavaziri, Madjid Mirzavaziri, Mohammad Hadi Shekarriz

Discuss. Math. Graph Theory, 2018

2017

Bounds for Distinguishing Invariants of Infinite Graphs.

Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mohammad Hadi Shekarriz

Electron. J. Comb., 2017