✦ LIBER ✦

Distance and connectivity measures in permutation graphs

✍ Scribed by Wayne Goddard; Michael E. Raines; Peter J. Slater

Book ID: 108315864
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 143 KB
Volume: 271
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00870-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance connectivity in graphs and digr

Distance connectivity in graphs and digraphs

✍ Balbuena, M. C.; Carmona, A.; Fiol, M. A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i

Connectivity and diameter in distance gr

Connectivity and diameter in distance graphs

✍ Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Connectivity measures in matched sum gra

Connectivity measures in matched sum graphs

✍ C. Balbuena; P. García-Vázquez; X. Marcote 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Permutation graphs: Connected domination

Permutation graphs: Connected domination and Steiner trees

✍ Charles J. Colbourn; Lorna K. Stewart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

On the distance connectivity of graphs a

On the distance connectivity of graphs and digraphs

✍ M.A. Fiol; J. Fàbrega 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be

Connected domination and Steiner set on

Connected domination and Steiner set on weighted permutation graphs

✍ K. Arvind; C. Pandu Regan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 521 KB