The following pages link to (Q5488328):
Displayed 6 items.
- On the total detection numbers of complete bipartite graphs (Q394295) (← links)
- Gap vertex-distinguishing edge colorings of graphs (Q456892) (← links)
- Extremal problems on detectable colorings of trees (Q952656) (← links)
- On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
- A note on the total detection numbers of cycles (Q2344011) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)