Title

Edge covering coloring of cartesian product and compositions of graphs

Date of Publication

2016

Document Type

Master's Thesis

Degree Name

Master of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Thesis Adviser

Yvette F. Lim

Defense Panel Member

Isagani B. Jos
Erminda C. Fortes
Leonor Aquino Ruivivar

Abstract/Summary

An edge coloring of a graph G is called an edge covering coloring if each color appears at each vertex at least once. The maximum positive integer k such that G has an edge covering coloring with k colors is called the edge covering chromatic index of G and is denoted by 0 c(G). A result from Gupta [4] enables us to conclude that for any graph G with minimum degree (G), we have (G){u100000}1 0 c(G) (G). This allows us to classify graphs as CI class if 0 c(G) = (G) and CII class otherwise. In the literature, the classification of different types of graphs such as bipartite graphs, peelable graphs, and double graphs, among others, has already been done. However, there were no studies found on the classification of the cartesian product and the composition of graphs. This paper aims to study the classification of these graphs as either CI or CII class graphs.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTG007029

Shelf Location

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

Physical Description

1 disc ; 4 3/4 inches

Keywords

Charts; diagrams; etc; Graphic methods; Complete graphs; Graph theory

This document is currently not available here.

Share

COinS