Files in this item

FilesDescriptionFormat

application/pdf

application/pdf3269869.pdf (3MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Coloring and Labeling Problems on Graphs
Author(s):Cranston, Daniel W.
Doctoral Committee Chair(s):West, Douglas B.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Mathematics
Abstract:A labeling of a graph is a bijective function from the set {1,2,...,|E|} onto the edges of the graph. The sum of the labels on edges incident to a vertex v is the vertex-sum at v. A labeling is antimagic if the vertex-sums are distinct. Ringel [19] conjectured that every connected graph other than K2 has an antimagic labeling. We prove that every regular bipartite graph other than a matching has an antimagic labeling.
Issue Date:2007
Type:Text
Language:English
Description:126 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.
URI:http://hdl.handle.net/2142/81760
Other Identifier(s):(MiAaPQ)AAI3269869
Date Available in IDEALS:2015-09-25
Date Deposited:2007


This item appears in the following Collection(s)

Item Statistics