Jurnal Ilmu Dasar
Vol 9 No 2 (2008)

Embedding Cycle Graphs Complements

Liliek Susilowati (Unknown)
Hendy Hendy (Unknown)
Yayuk Wayuni (Unknown)

Article Info

Publish Date
04 Jul 2008

Abstract

A graph is embeddable on a surface if it can be drawn on that surface without any edges intersect. The cycle graphs can always be embedded on the plane and the torus, but this is not occurred for their complements. We prove that the maximum order of cycle graphs such that their complements still can be embedded on the plane is 6. But, the maximum order of cycle graphs such that their complements still can be embedded on the torus is 9. Also, the crossing number of complements of cycle graphs which can’t be embedded on the plane with minimum order will be presented.

Copyrights © 2008




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
218.616 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Ilmu Dasar
Website

Abbrev

JID

Publisher

Universitas Jember

Subject

Control & Systems Engineering Mathematics

Description

Jurnal ILMU DASAR (JID) is a national peer-reviewed and open access journal that publishes research papers encompasses all aspects of natural sciences including Mathematics, Physics, Chemistry and Biology. JID publishes 2 issues in 1 volume per year. First published, volume 1 issue 1, in January ...