Minimum 2-clique and 3-clique partitions of simple connected graphs

Date of Publication

1992

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Applied Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

The researcher presents a computer-based procedure in determining the minimum number of 2-cliques and 3-cliques that can partition any given simple, connected graph G with degrees not exceeding four and with order n where 2 is less than or equal to n less than or equal to 12.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU05715

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

42 numb. leaves

Keywords

Graph theory; Algorithms; Programming (Mathematics)

This document is currently not available here.

Share

COinS