On token signed graphs
The paper introduces the notion of \(k\)-token signed graphs, which is a generalization of the concept of token graphs, and presents some of its combinatorial and algebraic properties. The frustration index of a signed graph is the minimum number of edges that we need to remove to obtain a balanced graph. This paper provides bounds for the frustration index of a \(k\)-token signed graph. Besides, the paper introduces and studies the unbalance level of a signed graph, which is a new parameter that measures how far a signed graph is from being balanced. Moreover, the relation between the frustration index and the unbalance level of signed graphs and their token signed graphs is described here.\N\NAdditionally, the paper demonstrates that if two signed graphs are switching isomorphic, then their corresponding token graphs are also switching isomorphic. The paper also discusses some spectral properties of \(k\)-token signed graphs. In particular, the Laplacian spectrum of a balanced signed graph is contained in the Laplacian spectra of its \(k\)-token signed graph.
- A note on the ranks of set-inclusion matrices
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
- Frustration and isoperimetric inequalities for signed graphs
- Frustration-critical signed graphs
- scientific article; zbMATH DE number 146670 (Why is no real title available?)
- Matrices in the theory of signed simple graphs
- On the Laplacian spectra of token graphs
- On the notion of balance of a signed graph
- Open problems in the spectral theory of signed graphs
- Signed graphs
- Six signed Petersen graphs, and their automorphisms
- Symmetric squares of graphs
- Token graphs
This page was built for publication: On token signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942658)
