## Poster & Oral Presentations

#### Presentation Title

Radio Number for Fifth Power Paths

#### Presentation Type

Poster & Oral Presentation

#### College

College of Natural Sciences

Mathematics

Event Center B

#### Faculty Mentor

Dr. Belisario Ventura

#### Start Date

2-27-2013 10:10 AM

#### End Date

2-27-2013 6:00 PM

#### Abstract

Let G be a connected graph and for any two vertices, u, v, let d(u,v) be distances in G. The maximum distance is called the diameter of G, diam(G). Then we find a radio labeling of G such that the inequality 1F(w)-F(v01> or = diam (G) –d(u,v) +1 holds. The radio number is the minimum span in G. We will discuss the progress made towards finding the radio number for the 5th power graph.

#### Share

COinS

Feb 27th, 10:10 AM Feb 27th, 6:00 PM

Radio Number for Fifth Power Paths

Event Center B

Let G be a connected graph and for any two vertices, u, v, let d(u,v) be distances in G. The maximum distance is called the diameter of G, diam(G). Then we find a radio labeling of G such that the inequality 1F(w)-F(v01> or = diam (G) –d(u,v) +1 holds. The radio number is the minimum span in G. We will discuss the progress made towards finding the radio number for the 5th power graph.