Oosterman, R.A. (2014) Zero Forcing Sets for Distance Regular Graphs. Bachelor's Thesis, Mathematics.

Text
Ruben_Oosterman_2014_WB.pdf  Published Version Download (444kB)  Preview 

Text
toestemming.pdf  Other Restricted to Backend only Download (20kB) 
Abstract
In this project, linear systems on graphs are studied, representing a multiagent system with leader and follower agents. These agents operate individually, but are able to interchange information with each other. Leader agents obtain input, follower agents do not. Depending on a certain set of leader agents, also named as a leader set, the system defined on its graph may be controllable. Therefore, the main purpose of this research is finding a feasible leader set for a certain graph such that the corresponding system is controllable. To reach this, one has to assign vertices as leader agents in a specific way. These vertices are assigned according to the socalled zero forcing principle. Leaders sets for which a certain system is controllable are said to be a zero forcing sets. When a solution is found, the zero forcing process can only determine whether a system is controllable for a given leader set. Unfortunately, it is not yet possible to assign these vertices in a straightforward manner, and it turns out that it is not even possible to verify whether this leader set is minimal. In order to still be able find feasible leader sets, a number of algorithms is descibed in this project. The class of distance regular graphs is treated most extensively, as this is the class of graphs which the given algorithms apply to. For certain graphs for which they are known to be distance regular, the algoritms are tested, and the result with the fewest possible leaders is taken. Comparing to certain properties of these graphs, such as the maximal eigenvalue multiplicity, one can finally decide whether the found leader set is optimal or not.
Item Type:  Thesis (Bachelor's Thesis) 

Degree programme:  Mathematics 
Thesis type:  Bachelor's Thesis 
Language:  English 
Date Deposited:  15 Feb 2018 07:57 
Last Modified:  15 Feb 2018 07:57 
URI:  https://fse.studenttheses.ub.rug.nl/id/eprint/11834 
Actions (login required)
View Item 