✦ LIBER ✦

Efficient edge domination problems in graphs

✍ Scribed by Dana L. Grinstead; Peter J. Slater; Naveed A. Sherwani; Nancy D. Holmes

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 558 KB
Volume: 48
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90084-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge domination in complete partite grap

Edge domination in complete partite graphs

✍ Bor-Liang Chen; Hung-Lin Fu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 416 KB

An edge dominating set in a graph G is a set of edges D such that every edge not in D is adjacent to an edge of D. An edge domatic partition of a graph C=(V, E) is a collection of pairwise-disjoint edge dominating sets of G whose union is E. The maximum size of an edge domatic partition of G is call

Generalized domination and efficient dom

Generalized domination and efficient domination in graphs

✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Local edge domination critical graphs

✍ Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Sumner and Blitch defined a graph G to be k-y-critical if 7(G) = k and 7(G + uv) = k -1 for each pair u, v of nonadjacent vertices of G. We define a graph to be k-( 7,d)-critical if 7(G) = k and 7(G + uv) = k -I for each pair u, v of nonadjacent vertices of G that are at distance at most d apart. Th

Edge domination on bipartite permutation

Edge domination on bipartite permutation graphs and cotriangulated graphs

✍ Anand Srinivasan; K. Madhukar; P. Nagavamsi; C.Pandu Rangan; Maw-Shang Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 KB

Note: The diameter of edge domination cr

Note: The diameter of edge domination critical graphs

✍ Matteo Paris 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

r-domination problems on homogeneously o

r-domination problems on homogeneously orderable graphs

✍ Dragan, Feodor F.; Nicolai, Falk 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

In this paper, we consider r-dominating cliques in homogeneously orderable graphs (a common generalization of dually chordal and distance-hereditary graphs) and their relation to strict r-packing sets. We prove that a homogeneously orderable graph G possesses an r-dominating clique if and only if fo