✦ LIBER ✦

Convex sets in graphs, II. Minimal path convexity

✍ Scribed by Pierre Duchet

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 550 KB
Volume: 44
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(88)90039-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minimal convex pairs of convex compac

On minimal convex pairs of convex compact sets

✍ Ryszard Urbański 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 534 KB

Minimal representation of convex polyhed

Minimal representation of convex polyhedral sets

✍ J. Telgen 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 998 KB

Minimal pairs of convex compact sets

✍ Jerzy Grzybowski 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 433 KB

Convex Sets in Lexicographic Products of

Convex Sets in Lexicographic Products of Graphs

✍ Bijo S. Anand; Manoj Changat; Sandi Klavžar; Iztok Peterin 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 162 KB

Convex Sets Under Some Graph Operations

✍ Sergio R. Canoy, Jr.; I.J.L. Garces 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 99 KB

Convexity of minimal total dominating fu

Convexity of minimal total dominating functions in graphs

✍ Yu, Bo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

A total dominating function (TDF) of a graph G = (V, E) is a function f : V → [0, 1] such that for each v ∈ V , the sum of f values over the open neighbourhood of v is at least one. Zero-one valued TDFs are precisely the characteristic functions of total dominating sets of G. We study the convexity