✦ LIBER ✦

End vertices in interval graphs

✍ Scribed by John Gimbel

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 289 KB
Volume: 21
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90071-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On eccentric vertices in graphs

✍ Chartrand, Gary; Schultz, Michelle; Winters, Steven J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB

The eccentricity e(u) of a vertex u in a connected graph G is the distance between u and a vertex furthest from u. The minimum eccentricity among the vertices of G is the radius rad G of G, and the maximum The radial number m(u) of u is the minimum eccentricity among the eccentric vertices of u, wh

Distinguished vertices in probabilistic

Distinguished vertices in probabilistic rooted graphs

✍ Gary Gordon; Ekaterina Jager 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

Non-κ-critical vertices in graphs

✍ H.J. Veldman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 494 KB

Peripheral and eccentric vertices in gra

Peripheral and eccentric vertices in graphs

✍ K. B. Reid; Gu Weizhen 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 658 KB

The optimal sequential and parallel algo

The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs

✍ Bera, Debashis ;Pal, Madhumangal ;Pal, Tapan K. 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 208 KB

Steiner intervals in graphs

✍ Ewa Kubicka; Grzegorz Kubicki; Ortrud R. Oellermann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 664 KB

Let G be a graph and U, L' two vertices of G. Then the interval from K to 2' consists of all those vertices that lie on some shortest u -1; path. Let S be a set of vertices in a connected graph G. Then the Steiner distance d,(S) of S in G is the smallest number of edges in a connected subgraph of G