activity
20162020
most citedSuperconformal indices at large and the entropy of AdS SE black holes

61 citations · 66 across the 20 of their papers we have counts for

collaborators

28 papers

hep-th2020★ 61 cited

Superconformal indices at large and the entropy of AdS SE black holes

Francesco Benini, Edoardo Colombo, Saman Soltani +2

The large limit of the four-dimensional superconformal index was computed and successfully compared to the entropy of a class of AdS black holes only in the particular case…

math.CO2018

Symmetry breaking in planar and maximal outerplanar graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) () of a graph is the least integer such that has a vertex (edge) labeling with labels that is preserved only by a tr…

math.CO2018

Total dominator chromatic number of -subdivision of graphs

Saeid Alikhani, Nima Ghanbari, Samaneh Soltani

Let be a simple graph. A total dominator coloring of , is a proper coloring of the vertices of in which each vertex of the graph is adjacent to every vertex of some colo…

math.CO2017

The chromatic distinguishing index of certain graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing index of a graph , denoted by , is the least number of labels in an edge labeling of not preserved by any non-trivial automorphism. The distinguish…

math.CO2017

Distinguishing critical graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number of a graph is the least integer such that has a vertex labeling with labels that is preserved only by a trivial automorphism. We sa…

math.CO2017★ 1 cited

Characterization of graphs with distinguishing number equal list distinguishing number

Saeid Alikhani, Samaneh Soltani

The distinguishing number of a graph is the least integer such that has an vertex labeling with labels that is preserved only by a trivial automorphism. A li…