Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Engineering

6th Annual Student Scholarsโ€™ Expo Of The School Of Mathematics, Engineering, And Business, Messiah College May 2009

6th Annual Student Scholarsโ€™ Expo Of The School Of Mathematics, Engineering, And Business, Messiah College

School of Science, Engineering & Health (SEH) Symposium

Celebrating the scholarly work our students have been engaged in throughout the year.


Quantifying Network Reliability Through Finding An Upper Bound For Graph Integrity Using Graph Coloring, Ian Burchett Jan 2009

Quantifying Network Reliability Through Finding An Upper Bound For Graph Integrity Using Graph Coloring, Ian Burchett

Mahurin Honors College Capstone Experience/Thesis Projects

Integrity of a graph is defined as ๐บ = ๐‘š๐‘–๐‘›๐‘†โŠ†๐‘‰(๐บ){ ๐‘† + ๐‘š ๐บ โˆ’ ๐‘† } , where G is a graph with vertex set V and m(G-S) denotes the order of the largest component of G - S. This provides an upper estimate of the integrity of the given graph. Using graph coloring, the color sequence of the graph can be generated, with the leading term being the largest component of the graph, the maximal independent set. The determination of the set is too time intensive to be feasible for moderate to large graphs, since there is no โ€ฆ