𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stage-graph representations

✍ Scribed by Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; Jörg-Rüdiger Sack; Jorge Urrutia


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
634 KB
Volume
75
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis


We consider graph applications of the well-known paradigm "killing two birds with one stone". In the plane, this gives rise to a stage graph as follows: vertices are the points, and {u, II} is an edge if and only if the (infinite, straight) line segment joining u to u intersects the stage. Such graphs are shown to be comparability graphs of ordered sets of dimension 2. Similar graphs can be constructed when we have a fixed number k of stages on the plane. In this case, {u, u} is an edge if and only if the (straight) line segment uu intersects one of the k stages. In this paper, we study stage representations of stage graphs and give upper and lower bounds on the number of stages needed to represent a graph.


📜 SIMILAR VOLUMES


Representation of graphs
✍ Alon Itai; Michael Rodeh 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 254 KB
Understanding multibody dynamics using b
✍ Dean Karnopp 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 526 KB

The dynamics of complex interconnected mechanical systems can be described using u number of Jbrmalized procedures in thefield of multibody dynamics but it is not always easy to understand the significance of the quantities introduced as part of these various procedures. Bond graphs can also be used

Homogeneously representable interval gra
✍ Dale Skrien; John Gimbel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 258 KB

## We characterize those interval graphs G with the property that, for every vertex u, there exists an interval represention of G in which the interval representing 21 is the left-most (or right-most) interval in the representation.