23 citations · 62 across the 16 of their papers we have counts for
16 papers
Overcoming Tight Constraints in Soft Happy Colouring
Mohammad Hadi Shekarriz, Asef Nazari, Dhananjay Thiruvady
The Soft Happy Colouring (SHC) problem, a mathematical framework for identifying homophilic network structures, seeks to maximise the number of -happy vertices, i.e., vertices w…
Finding happiness by evolutionary algorithms
Mohammad Hadi Shekarriz, Dhananjay Thiruvady, Asef Nazari
A recent line of research concerns the problem of soft happy colouring (SHC), which requires that a partially coloured graph be extended to a complete colouring to maximise local a…
Local Search Improvements for Soft Happy Colouring
Mohammad Hadi Shekarriz, Dhananjay Thiruvady, Asef Nazari +1
For and a coloured graph , a vertex is -happy if at least of its neighbours have the same colour as . Soft happy colouring of a part…
Soft happy colourings and community structure of networks
Mohammad H. Shekarriz, Dhananjay Thiruvady, Asef Nazari +1
For , a -happy vertex in a coloured graph has at least same-colour neighbours, and a -happy colouring (aka soft happy colouring) o…
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
Saeid Alikhani, Mohammad Hadi Shekarriz
A coloring is distinguishing (or symmetry breaking) if no non-identity automorphism preserves it. The distinguishing threshold of a graph , denoted by , is the minimum num…
Distinguishing threshold for some graph operations
Mohammad Hadi Shekarriz, Seyed Alireza Talebpour Shirazi Fard, Bahman Ahmadi +2
A vertex coloring of a graph is distinguishing if non-identity automorphisms do not preserve it. The distinguishing number, , is the minimum number of colors required for…
The number of distinguishing colorings of a Cartesian product graph
Saeid Alikhani, Mohammad Hadi Shekarriz
A vertex coloring is called distinguishing if the identity is the only automorphism that can preserve it. The distinguishing threshold of a graph is the minimum number o…
Distinguishing threshold of graphs
Mohammad Hadi Shekarriz, Bahman Ahmadi, Seyed Alireza Talebpour Shirazi Fard +1
A vertex coloring of a graph is called distinguishing if no non-identity automorphisms of can preserve it. The distinguishing number of , denoted by , is the minim…
Noncontextual coloring of orthogonality hypergraphs
Mohammad H. Shekarriz, Karl Svozil
We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they al…
On the Total Graph of a Finite Commutative Ring
Mohammad Hadi Shekarriz, Mohammad Hasan Shirdareh Haghighi, Habib Sharif
Let be a finite commutative ring with . In this article, we study the total graph of , denoted by , determine some of its basic graph-theoretical properties, d…
A Characterization For 2-Self-Centered Graphs
Mohammad Hadi Shekarriz, Madjid Mirzavaziri, Kamyar Mirzavaziri
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered gra…
Bounds for Distinguishing Invariants of Infinite Graphs
Wilfried Imrich, Rafał Kalinowski, Monika Pilśniak +1
We consider infinite graphs. The distinguishing number of a graph is the minimum number of colours in a vertex colouring of that is preserved only by the trivial aut…
The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs
Aleksandra Gorzkowska, Mohammad Hadi Shekarriz
A graph is said to be -distinguishable if there is a vertex coloring of with a set of colors which breaks all of the automorphisms of but the identity. We call t…
Number of Distinguishing Colorings and Partitions
Bahman Ahmadi, Fatemeh Alinaghipour, Mohammad Hadi Shekarriz
A vertex coloring of a graph is called distinguishing (or symmetry breaking) if no non-identity automorphism of preserves it, and the distinguishing number, shown by …
Strong Twins of Ordinary Star-Like Self-Contained Graphs
Mohammad Hadi Shekarriz, Madjid Mirzavaziri
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, ordinary star-like self-contained graphs are introduced and i…
Self-Contained Graphs
Mohammad Hadi Shekarriz, Madjid Mirzavaziri
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defi…