S. Soltani

collaborators

6 papers

math.CO2017

Distinguishing number and distinguishing index of strong product of two graphs

Samaneh Soltani, Saeid Alikhani

The distinguishing number (index) $D (G)$ ( $D^{'} (G)$ ) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved on…

math.CO2017

An upper bound on the distinguishing index of graphs with minimum degree at least two

Saeid Alikhani, Samaneh Soltani

The distinguishing index of a simple graph $G$ , denoted by $D^{'} (G)$ , is the least number of labels in an edge labeling of $G$ not preserved by any non-trivial automorphism. It was c…

math.CO2016

Distinguishing number and distinguishing index of lexicographic product of two graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) $D (G)$ ( $D^{'} (G)$ ) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved on…

math.CO2016

Distinguishing number and distinguishing index of neighbourhood corona of two graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) $D (G)$ ( $D^{'} (G)$ ) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved on…

math.CO2016

Distinguishing number and distinguishing index of some operations on graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) $D (G)$ ( $D^{'} (G)$ ) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved on…

math.CO2016

Distinguishing number and distinguishing index of natural and fractional powers of graphs

Saeid Alikhani, Samaneh Soltani

The distinguishing number (index) $D (G)$ ( $D^{'} (G)$ ) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved on…