Title of article
On the isomorphism problem for a family of cubic metacirculant graphs Original Research Article
Author/Authors
Ngo Dac Tan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
12
From page
231
To page
242
Abstract
In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol S0 is given. The time complexity of this algorithm is also evaluated.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943780
Link To Document