Pages that link to "Item:Q5020420"
From MaRDI portal
The following pages link to Distinguishing number and distinguishing index of certain graphs (Q5020420):
Displayed 5 items.
- The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- (Q6166316) (← links)