Generalizing the Formulae for the Wiener Indices of the Double Vertex Graphs of Certain Families of Graphs
Overview
Graphs are defined as a set of vertices and a set of edges consisting of unordered pairs of vertices. They can be used to model many real-world structures, systems and especially networks. They aren’t particularly old topics of interest, the first academic work on graphs were done by Leonhard Euler in 1736. Since then, many functions, indices and graph-valued functions on graphs have been created and studied by many modern prevalent mathematicians. My project’s topics of interest consist of the Double Vertex function and the Wiener index. Through the course of this project, we have both analytically and logically derived the formula for the Wiener index of the Double Vertex graphs of path, cycle, wheel, and complete graphs, where these derivations could also be used to determine the formula for other graph families.
Competition history
- ISEF 2020
Resources
Related projects
ISEF · 2023
Elementary Proofs of the Properties of the Sierpinski Gasket Graph
ISEF · 2021
Ranking of the Vertices in a Weighted Graph
ISEF · 2024
Injective Chromatic Index of Packet Radio Networks: Improved Upper Bounds
ISEF · 2015
Structural Properties of 2-Bijective Connection Networks
ISEF · 2025
Generation of Phi-4 Feynman Graphs Through a Recursive Algorithm
ISEF · 2023
Extremal Problems on the Steiner k-Distance and the Steiner k-Wiener Index
ISEF · 2016
Break Divisors as Canonical Representatives for Divisor Classes on Complete Graphs: Applications to the Internet of Things
JSHS · 2024
Injective Chromatic Index of Packet Radio Networks: Improved Upper Bounds
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair