The dimension of the negative cycle vectors of a signed graph
From MaRDI portal
(Redirected from Publication:5225061)
Abstract: A "signed graph" is a graph where the edges are assigned sign labels, either "" or "". The sign of a cycle is the product of the signs of its edges. Let denote the list of lengths of cycles in . We equip each signed graph with a vector whose entries are the numbers of negative -cycles for . These vectors generate a subspace of . Using matchings with a strong permutability property, we provide lower bounds on the dimension of this space; in particular, we show for complete graphs, complete bipartite graphs, and a few other graphs that this space is all of .
Recommendations
- Negative cycles in complete signed graphs
- scientific article; zbMATH DE number 1958615
- Signed cycle domination numbers of graphs
- The signed cycle domination numbers of a graph and its complement
- On adjacency matrices and descriptors of signed cycle graphs
- The nullity of bicyclic signed graphs
- A method of enumeration of negative cycles of a signed graph
- scientific article; zbMATH DE number 32031
- On signed cycle (vertex) domination in graphs
Cites work
- Frustrated triangles
- Graphs that contain multiply transitive matchings
- scientific article; zbMATH DE number 3512159 (Why is no real title available?)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- Negative cycles in complete signed graphs
- On the notion of balance of a signed graph
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
Cited in
(4)
This page was built for publication: The dimension of the negative cycle vectors of a signed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225061)