Contents

Ars Combinatoria

  • Research article

Self-Complementary Graphs with Minimum Degree Two

Kiyoshi Ando1, Atsuhiro Nakamoto2
1Department of Computer Science and Information Mathematics The University of Electro-Communications 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, Japan
2Department of Mathematics Osaka Kyoiku University 4-698-1 Asahigaoka, Kashiwara, Osaka 852-8582, Japan
  • Published: 31/10/2002

Abstract

In this paper, we shall classify the self-complementary graphs with minimum degree exactly \(2\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Kiyoshi Ando, Atsuhiro Nakamoto. Self-Complementary Graphs with Minimum Degree Two[J], Ars Combinatoria, Volume 065. 65-74. .