Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent
From MaRDI portal
Publication:726520
DOI10.1007/s40840-015-0264-4zbMath1339.05171OpenAlexW2247995633MaRDI QIDQ726520
Publication date: 11 July 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0264-4
balanced signed graphconsistent marked graphiterated signed line graphsnegative sectionsigned line graph
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of a signed graph whose signed line graph is \(S\)-consistent
- A characterization of consistent marked graphs
- Some further properties of consistent marked graphs
- New algebraic models of social systems
- A simple algorithm to detect balance in signed graphs
- Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures
- Consistency in marked digraphs
- Signed analogs of bipartite graphs
- A mathematical bibliography of signed and gain graphs and allied areas
- Characterizations of consistent marked graphs
- Line-coloring of signed graphs
- On the notion of balance of a signed graph
- A Characterization of Line Sigraphs
- Spectral criterion for cycle balance in networks
- Counting balanced signed graphs using marked graphs
- Consistent graphs with signed points
- On Repeated Interchange Graphs
- A characterization of consistent marked graphs
This page was built for publication: Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent