A graph in which every edge is labeled positive or negative is called a signed graph. We determine the number of ways to sign the edges of the McGee graph with exactly two negative edges up to switching isomorphism. We characterize signed graphs that are both sign-symmetric and have a frustration index of 1. We prove some results about which signed graphs on complete multipartite graphs have frustration indices 2 and 3. In the final part, we derive the relationship between the frustration index and the number of parts in a sign-symmetric signed graph on complete multipartite graphs.
| Identifer | oai:union.ndltd.org:MSSTATE/oai:scholarsjunction.msstate.edu:td-6995 |
| Date | 08 December 2023 |
| Creators | Alotaibi, Abdulaziz |
| Publisher | Scholars Junction |
| Source Sets | Mississippi State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
Page generated in 0.0017 seconds