Displaying 101 – 120 of 125

Showing per page

On the lattice of additive hereditary properties of finite graphs

Ján Jakubík (2002)

Discussiones Mathematicae - General Algebra and Applications

In this paper it is proved that the lattice of additive hereditary properties of finite graphs is completely distributive and that it does not satisfy the Jordan-Dedekind condition for infinite chains.

On the p-domination number of cactus graphs

Mostafa Blidia, Mustapha Chellali, Lutz Volkmann (2005)

Discussiones Mathematicae Graph Theory

Let p be a positive integer and G = (V,E) a graph. A subset S of V is a p-dominating set if every vertex of V-S is dominated at least p times. The minimum cardinality of a p-dominating set a of G is the p-domination number γₚ(G). It is proved for a cactus graph G that γₚ(G) ⩽ (|V| + |Lₚ(G)| + c(G))/2, for every positive integer p ⩾ 2, where Lₚ(G) is the set of vertices of G of degree at most p-1 and c(G) is the number of odd cycles in G.

Currently displaying 101 – 120 of 125