Pages that link to "Item:Q4969593"

The following pages link to An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593):

Displaying 2 items.

• Trees with distinguishing number two (Q2176156) (← links)
• The distinguishing index of connected graphs without pendant edges (Q4988841) (← links)