An investigation into properties of the Closeness Centrality of a graph

The project will focus on uncovering three types of graph properties: 1. Find new expressions for the closeness centrality of a connected graph with respect to specific infinite families of graphs; 2. Find new general bounds on the closeness centrality of a connected graph; 3. Determine how closeness centrality changes under graph operations on the given graph G.

Yuqi Liu

The University of New South Wales

Yuqi Liu is a 4th-year undergraduate student currently studying Finance and Mathematics at the University of New South Wales. She is an avid learner and an enthusiastic problem solver who always ready to take a deep dive into the mathematics world. Her research interest is graph theory, combinatorics, and discrete mathematics, particularly in the closeness centrality of a graph.

You may be interested in

Georgio Hawi

Georgio Hawi

Polynomial Method in Additive Combinatorics: Extension of CAP Sets Problem to More Than Three Points
Nelly Tucker

Nelly Tucker

Long memory random walks
Mitchell Holt

Mitchell Holt

Modular Algorithms for Computation in Simple Algebraic Extension Fields
Saakshi Singh

Saakshi Singh

Brauer Monoid Factorisations using Machine Learning Techniques
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.