✦ LIBER ✦

Edge Domination in Graphs of Cubes

✍ Scribed by Bohdan Zelinka

Book ID: 111577391
Publisher: Springer
Year: 2002
Tongue: English
Weight: 85 KB
Volume: 52
Category: Article
ISSN: 0011-4642
DOI: 10.1023/b:cmaj.0000027240.09975.5e

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

Efficient edge domination problems in gr

Efficient edge domination problems in graphs

✍ Dana L. Grinstead; Peter J. Slater; Naveed A. Sherwani; Nancy D. Holmes 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 558 KB

Efficient edge domination in regular gra

Efficient edge domination in regular graphs

✍ Domingos M. Cardoso; J. Orestes Cerdeira; Charles Delorme; Pedro C. Silva 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 536 KB

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

On edge domination numbers of graphs

✍ Baogen Xu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Edge lifting and total domination in gra

Edge lifting and total domination in graphs

✍ Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 481 KB