On distance-irregular labelings of cycles and wheels
Large interconnection networks with given degree and diameter
Vertex-magic labelings: mutations
Resolvability of graphs
All regular graphs of small odd order are vertex-magic
Strong edge-magic graphs of maximum size
Are you sure you would like to clear your session, including search history and login status?