H - Removable Sequences of Graphs

<italic>H</italic>-removable sequences, for arbitrary <italic>H</italic>, under &Lambda^* construction are presented here. In the first part we investigate Neighborhood Distinct (ND) graphs and ask some natural questions concerning disconnected <italic>H</italic> and <italic>H</italic> complement. In the second part, we introduce property * and investigate graphs that satisfy property *. Consequently we find $H$-removable sequences for all graphs <italic>H</italic> with up to 6 vertices except for G60. G60 is the only graph with up to 6 vertices for which neither it nor its complement satisfies property *. The last part of our work focuses on good and bad copies of arbitrary graphs $H$ and how to interchange from one to the other. The number of ways to count all possible copies of <italic>H</italic> in <italic>H</italic>_{pn} ^ &Lambda^* is also presented via examples.

Name thesis:degree_name

Doctor of Philosophy

Level thesis:degree_level

Campus Only Dissertation

Discipline thesis:degree_discipline

Mathematics

Year

2014

Author dc:creator

• Adatorwovor, Dayana

Contributors dc:contributor

• McSorley, John

• automorphisms
• graph
• neighborhood distinct
• removable
• removable sequences
• sequences

Repository record dc:identifier

https://opensiuc.lib.siu.edu/dissertations/791

OAI identifier oai:identifier

oai:opensiuc.lib.siu.edu:dissertations-1794