On token signed graphs

We introduce the concept of a k -token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the Laplacian spectrum of a balanced signed graph is contained in the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of algebraic combinatorics Ročník 62; číslo 1; s. 7
Hlavní autoři: Dalfó, C., Fiol, M. A., Steffen, E.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2025
Springer Nature B.V
Témata:
Combinatorial analysis
Combinatorics
Computer Science
Convex and Discrete Geometry
Graphs
Group Theory and Generalizations
Lattices
Mathematics
Mathematics and Statistics
Order
Ordered Algebraic Structures
Signatures
Signed graph
Laplacian spectrum
Token graph
ISSN:0925-9899, 1572-9192
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We introduce the concept of a k -token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the Laplacian spectrum of a balanced signed graph is contained in the Laplacian spectra of its k -token signed graph. Besides, we introduce and study the unbalance level of a signed graph, which is a new parameter that measures how far a signed graph is from being balanced. Moreover, we study the relation between the frustration index and the unbalance level of signed graphs and their token signed graphs.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-9899
1572-9192
DOI:10.1007/s10801-025-01416-4