Title of article :
2-connected and 2-edge-connected Steinhaus graphs Original Research Article
Author/Authors :
Dongju Kim، نويسنده , , Daekeun Lim، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Abstract :
The numbers of 2-connected and 2-edge-connected Steinhaus graphs with n vertices are determined for n⩾6. The possible generating strings of 2-connected and 2-edge-connected Steinhaus graphs are classified.
Keywords :
Steinhaus graph , Connectivity , Pendent-vertex , Generating string
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
