Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree

• Main Author: Blalock, Constance M
• Format: Others
• Published: Digital Commons @ East Tennessee State University 2014
• Subjects: graph theory; weighted graphs; vertex weight; Mathematics; Physical Sciences and Mathematics
• Online Access: https://dc.etsu.edu/etd/2416; https://dc.etsu.edu/cgi/viewcontent.cgi?article=3774&context=etd

Graphs can effectively model biomolecules, computer systems, and other applications. A weighted graph is a graph in which values or labels are assigned to the edges of the graph. However, in this thesis, we assign values to the vertices of the graph rather than the edges and we modify several standard graphical measures to incorporate these vertex weights. In particular, we designate the degree of each vertex as its weight. Previous research has not investigated weighting vertices by degree. We find the vertex weighted domination number in connected graphs, beginning with trees, and we define how weighted vertices can affect eccentricity, independence number, and connectivity.