Article
Version 1
Preserved in Portico This version is not peer-reviewed
Embedding Some Classes of Signed Graphs in the Line
Version 1
: Received: 29 September 2023 / Approved: 1 October 2023 / Online: 1 October 2023 (07:17:09 CEST)
How to cite: Sattari, S. Embedding Some Classes of Signed Graphs in the Line. Preprints 2023, 2023100010. https://doi.org/10.20944/preprints202310.0010.v1 Sattari, S. Embedding Some Classes of Signed Graphs in the Line. Preprints 2023, 2023100010. https://doi.org/10.20944/preprints202310.0010.v1
Abstract
A signed graph is an undirected graph such that all of its edges are labeled positive or negative. Let D be an embedding of a signed graph G in the Euclidean line. If in D for all of the vertices their positive neighbors are closer than the negative neighbors, then D is called a valid drawing of G. In this paper we show that signed trees, unicyclic graphs, and ladder graphs have a valid drawing in the Euclidean line.
Keywords
Signed graph; Valid drawing; Tree; Unicyclic graph; Ladder graph
Subject
Computer Science and Mathematics, Discrete Mathematics and Combinatorics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
