Abstract

The edge betweenness centrality of an edge is defined as the ratio of shortest paths between all pairs of vertices passing through that edge. A graph is said to have k-uniform edge betweenness centrality, if there are k different edge betweenness centrality values. In this thesis we investigate graphs that have k-uniform edge betweenness centrality where k=2 or 3, and precisely determine the edge betweenness centrality values for various families of graphs.

Publication Date

5-21-2018

Document Type

Thesis

Student Type

Graduate

Degree Name

Applied and Computational Mathematics (MS)

Department, Program, or Center

School of Mathematical Sciences (COS)

Advisor

Matthew J. Hoffman

Advisor/Committee Member

Darren Narayan

Advisor/Committee Member

Jobby Jacob

Campus

RIT – Main Campus

Share

COinS