OpenAlex
The distinguishing number and distinguishing index of the lexicographic product of two graphs
Work
Year: 2018
Type: article
Abstract: The distinguishing number (index) D(G) (D ′ (G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.... more
Institution Yazd University
Cites: 8
Cited by: 10
Related to: 10
FWCI: 1.21
Citation percentile (by year/subfield): 66.93
Open Access status: diamond