Back to search

Monterey, CA; Naval Postgraduate School

On the determination of planar graphs.

Abstract

dc:description.abstract

Various algorithms for testing the planarity of a graph are reviewed. The Phung-Chan algorithm is improved by modifying the method of application of the necessary and sufficient condition that a pseudo-Hamiltonian graph be planar and the method of determination of circuit C(k) with as many edges as possible, and from which the pseudo- Hamiltonian graph is defined. By application of the proposed algorithm it is proved that the algorithm can be applied to an arbitrary graph. Using this proposed algorithm, the rate of convergence of the algorithm is increased and the computer storage requirement is minimized.

Degree

thesis:*
Name thesis:degree_name
M.S. in Electrical Engineering
Level thesis:degree_level
Masters
Discipline thesis:degree_discipline
Electrical Engineering
Department dc:contributor.department
Electrical Engineering
Grantor dc:publisher
Monterey, CA; Naval Postgraduate School
Year dc:date.issued
1974

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kim, Chong-hwa
Advisor dc:contributor.advisor
  • Chan, S.G.

Rights

dc:rights
Statement dc:rights
  • Copyright is reserved by the copyright owner.
  • Approved for public release; distribution is unlimited.

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10945/17153

Chain of custody

source
Harvested from
Naval Postgraduate School
Base URL
calhoun.nps.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Kim, Chong-hwa. On the determination of planar graphs.. Masters thesis, Monterey, CA; Naval Postgraduate School, 1974. https://hdl.handle.net/10945/17153