Maximal signed graphs with odd signed cycles as star complements

Xiying Yuan, Yanqi Mao and Lele Liu

Applied Mathematics and Computation, 2021, vol. 408, issue C

Abstract: Maximal signed graphs with signed cycles C3 or C5 as a star complement for (adjacency) eigenvalue −2 are completely characterized in this paper. The switching equivalence of the maximal signed graphs is studied. Specifically, if Σ1′ is switching equivalent to Σ2′, and Σ1 is a maximal signed graph with Σ1′ as a star complement for μ, then there exists a maximal signed graph Σ2 switching equivalent to Σ1 with Σ2′ as a star complement for μ. We also consider the order of the maximal signed graphs with odd cycle as a star complement for eigenvalue −2.

Keywords: Signed graph; Star set; Star complement; Switching equivalent; Eigenvalue (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321004562
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:408:y:2021:i:c:s0096300321004562

DOI: 10.1016/j.amc.2021.126367

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().