✦ LIBER ✦

Vector representation of graph domination

✍ Scribed by Noga Zewi

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 203 KB
Volume: 70
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20606

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We study a function on graphs, denoted by “Gamma”, representing vectorially the domination number of a graph, in a way similar to that in which the Lovsz Theta function represents the independence number of a graph. This function is a lower bound on the homological connectivity of the independence complex of the graph, and hence is of value in studying matching problems by topological methods. Not much is known at present about the Gamma function, in particular, there is no known procedure for its computation for general graphs. In this article we compute the precise value of Gamma for trees and cycles, and to achieve this we prove new lower and upper bounds on Gamma, formulated in terms of known domination and algebraic parameters of the graph. We also use the Gamma function to prove a fractional version of a strengthening of Ryser's conjecture. © 2011 Wiley Periodicals, Inc. J Graph Theory

📜 SIMILAR VOLUMES

A note on vector representation of graph

A note on vector representation of graphs

✍ Edita Šiňajová 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 159 KB

%ajov& E., A note on vector representation of graphs, Discrete Mathematics 89 (1991) 315-317.

On domination and independent domination

On domination and independent domination numbers of a graph

✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

Estimations for the domination number of

Estimations for the domination number of a graph

✍ Peter Flach; Lutz Volkmann 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 345 KB

On the r-domination number of a graph

✍ Jerrold R. Griggs; Joan P. Hutchinson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 468 KB

For r > 0, let the r-domination number of a graph, d,, be the size of a smallest set of vertices such that every vertex of the graph is within distance r of a vertex in that set. This paper contains proofs that every graph with a spanning tree with at least n/2 leaves has d, s n/(2r); this compares

Bounds on the -domination number of a gr

Bounds on the -domination number of a graph

✍ Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that