23 citations · 62 across the 16 of their papers we have counts for
5 papers · 1 filter
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…