Search Sciweavers | Sciweavers

29 search results - page 1 / 6

» Upper domination and upper irredundance perfect graphs

click to vote

DM
1998

100views more DM 1998»

Upper domination and upper irredundance perfect graphs

13 years 5 months ago

Download www.cems.uwe.ac.uk

Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...

Gregory Gutin, Vadim E. Zverovich

claim paper

Read More »

click to vote

DM
2002

91views more DM 2002»

A disproof of Henning's conjecture on irredundance perfect graphs

13 years 5 months ago

Download www.cems.uwe.ac.uk

Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...

Lutz Volkmann, Vadim E. Zverovich

claim paper

Read More »

click to vote

DM
2008

119views more DM 2008»

A generalised upper bound for the k-tuple domination number

13 years 5 months ago

Download www.cems.uwe.ac.uk

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...

Andrei Gagarin, Vadim E. Zverovich

claim paper

Read More »

click to vote

EJC
2008

95views Information Technology» more EJC 2008»

The upper bound on k-tuple domination numbers of graphs

13 years 5 months ago