An exposition on Eulerian irregularity in graphs

Date of Publication

2015

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

In this paper, we present an exposition of the first two sections in the article, On Eulerian Irregularity in Graphs . In the Chinese Postman Problem, we are asked to find the minimum length of a closed walk in a connected graph G such that every edge of G appears on the walk once or twice. Another interesting problem is finding the minimum length of a closed walk in G in which no two edges are encountered the same number of times. An Irregular Eulerian Walk in G is an Eulerian Walk that encounters no two edges of G the same number of times. The minimum length of an Irregular Eulerian Walk in G is said to be the Eulerian Irregularity of G, denoted by EI(G). Given a nontrivial connected graph G of size m, we determine the minimum length of an Irregular Eulerian walk in G known as the Eulerian Irregularity of G such that m + 1 2 EI(G) 2 m + 1 2 : 1.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU021093

Shelf Location

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

Keywords

Graph theory; Domination (Graph theory)

This document is currently not available here.

Share

COinS