Let Γ = (K n , H − ) be a signed complete graph whose negative edges induce a subgraph H. The index of Γ is the largest eigenvalue of its adjacency matrix. In this paper we study the index of Γ when H is a unicyclic graph. We show that among all signed complete graphs of order n > 5 whose negative edges induce a unicyclic graph of order k and maximizes the index, the negative edges induce a triangle with all remaining vertices being pendant at the same vertex of the triangle.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.