The dimension of valid distance drawings of signed graphs

DOI10.1007/S00454-019-00114-WzbMATH Open1429.05085OpenAlexW2966581227MaRDI QIDQ2283115FDOQ2283115

Authors: Quico Spaen, Christopher Thraves Caro, Mark Velednitsky 

Publication date: 30 December 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-019-00114-w

Recommendations

• Can everybody sit closer to their friends than their enemies?
• Signed distance in signed graphs
• Embedding signed graphs in the line
• Sitting closer to friends than enemies, revisited
• The dimension of the negative cycle vectors of a signed graph

zbMATH Keywords

metric spacessigned graphsgraph drawingsitting closer to friends than enemies problemvalid distance drawing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Consensus Problems on Networks With Antagonistic Interactions
• Edge lengths guaranteed to form a simplex
• The evolution of beliefs over signed social networks
• Embedding signed graphs in the line
• Sitting closer to friends than enemies, revisited
• Can everybody sit closer to their friends than their enemies?

Cited In (5)

• The weighted sitting closer to friends than enemies problem in the line
• Embedding signed graphs in the line
• Sitting closer to friends than enemies, revisited
• Sitting closer to friends than enemies, revisited
• Can everybody sit closer to their friends than their enemies?

Uses Software

• OEIS
• Adam

This page was built for publication: The dimension of valid distance drawings of signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283115)