Signed analogs of bipartite graphs
From MaRDI portal
Publication:1377721
DOI10.1016/S0012-365X(96)00386-XzbMath0890.05060MaRDI QIDQ1377721
Publication date: 29 June 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (13)
Chordally signed graphs ⋮ Unnamed Item ⋮ Unitary Addition Cayley Ring Signed Graphs * ⋮ Results on Lict Signed GraphsLc(S) ⋮ Negation switching invariant 3-Path signed graphs ⋮ Unitary Cayley meet signed graphs ⋮ Characterization of 2-path signed network ⋮ Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2\)] ⋮ Iterated local transitivity model for signed social networks ⋮ Unnamed Item ⋮ Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent ⋮ Spectral analysis of t-path signed graphs ⋮ On \(\bullet\)-line signed graphs \(L_\bullet(S)\)
Cites Work
- On local balance and \(n\)-balance in signed graphs
- Combinatorics of orientation reversing polygons
- Graph-encoded maps
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Biased graphs. II: The three matroids
- On the notion of balance of a signed graph
- Orientation embedding of signed graphs
- The combinatorial map color theorem
- Generalized Embedding Schemes
This page was built for publication: Signed analogs of bipartite graphs