On coding of molecular graphs

Date

3-1988

Degree

Bachelor of Science in Agriculture

College

College of Arts and Sciences (CAS)

Adviser/Committee Chair

Rolando G Panopio

Abstract

Two algorithms, Morgan’s and Randic’s were discussed and implemented to generate for each molecular structure a unique and invariant code. A comparison of performance of the two algorithms showed that the use of eigenvector coefficient in numbering more stable than using extended connectivity values and that the Morgans "growing a spanning tree" concept in ordering these atoms result in unique in a connection table code.

Language

English

Location

UPLB Main Library Special Collections Section (USCS)

Call Number

Thesis

Document Type

Thesis

This document is currently not available here.

Share

COinS