Return to search

Sign-symmetry and frustration index in signed graphs

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.

Identiferoai:union.ndltd.org:MSSTATE/oai:scholarsjunction.msstate.edu:td-6995
Date08 December 2023
CreatorsAlotaibi, Abdulaziz
PublisherScholars Junction
Source SetsMississippi State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceTheses and Dissertations

Page generated in 0.002 seconds