61 citations · 66 across the 20 of their papers we have counts for
13 papers · 1 filter
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…
The cost number and the determining number of a graph
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. The…
The distinguishing chromatic number of bipartite graphs of girth at least six
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. The d…