id: 06088166
dt: a
an: 06088166
au: Zhou, Houqing
ti: On self-complementary of circulant graphs.
so: Zhou, Qihai (ed.), Theoretical and mathematical foundations of computer
    science. Second international conference, ICTMF 2011, Singapore, May
    5‒6, 2011. Selected papers. Berlin: Springer (ISBN
    978-3-642-24998-3/pbk; 978-3-642-24999-0/ebook). Communications in
    Computer and Information Science 164, 464-471 (2011).
py: 2011
pu: Berlin: Springer
la: EN
cc: 
ut: strongly regular; self-complementary; circulant graphs
ci: 
li: doi:10.1007/978-3-642-24999-0_64
ab: Summary: a graph $G$ is self-complementary if it is isomorphic to its
    complement $\overline G$. If $G$ is a regular self-complementary graph,
    then $G$ is connected and has $n = 4k +1$ vertices and degree $r = 2k$,
    where $n,k$ are positive integers. In this paper, we investigate the
    existence condition for self-complementary of circulant graphs with
    order $n = 4k +1$. Moreover, we proved that the circulant graphs of
    order 17 exist self-complementary strongly regular graphs.
rv: