AbstractThe domination number γ(G) and the irredundance number ir(G) of a graph G have been considered by many authors. It is well known that ir(G) ⩽ γ(G) holds for all graphs G. In this paper we investigate the concept of irredundance perfect graphs which deals with those graphs that have all their induced subgraphs H satisfying ir(H) = γ(H). We give a characterization of those graphs G for which ir(H) = γ(H) for every induced subgraph H of G with ir(H) = 2 in terms of 30 forbidden induced subgraphs. A sufficient condition for ir(G) = γ(G) for a graph G with ir(G) ⩽ 4 is given in terms of three forbidden subgraphs. This result strengthens a conjecture due to Favaron (1986) which states that if a graph G does not contain these three forbidd...
AbstractIn this paper we consider the following parameters: IR(G), the upper irredundance number, wh...
Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectivel...
Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectivel...
AbstractLet β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upp...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
AbstractThe domination number γ(G) and the irredundance number ir(G) of a graph G have been consider...
AbstractIn this paper we consider the following graph parameters: IR(G), the upper irredundance numb...
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irred...
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irred...
AbstractLet β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upp...
AbstractLet π and τ be two arbitrary graph parameters that satisfy π(G)⩾τ(G) for every graph G. For ...
AbstractIn this paper we consider the following parameters: IR(G), the upper irredundance number, wh...
Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectivel...
Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectivel...
AbstractLet β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upp...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. ...
AbstractThe domination number γ(G) and the irredundance number ir(G) of a graph G have been consider...
AbstractIn this paper we consider the following graph parameters: IR(G), the upper irredundance numb...
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irred...
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irred...
AbstractLet β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upp...
AbstractLet π and τ be two arbitrary graph parameters that satisfy π(G)⩾τ(G) for every graph G. For ...
AbstractIn this paper we consider the following parameters: IR(G), the upper irredundance number, wh...
Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectivel...
Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectivel...