1 citations · 1 across the 12 of their papers we have counts for
18 papers · 1 filter
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…
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…
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…
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…
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…
The distinguishing index of graphs with at least one cycle is not more than its distinguishing number
Saeid Alikhani, Samaneh Soltani
The distinguishing number (index) () of a graph is the least integer such that has an vertex (edge) labeling with labels that is preserved only by the…