Outputs (3)

Upper domination and upper irredundance perfect graphs (1998)
Journal Article

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), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H)... Read More about Upper domination and upper irredundance perfect graphs.

Line hypergraphs: A survey (1998)
Journal Article

The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. This function generalizes two classical concepts at once, namely the line graph and the dual hypergraph. In a certain sense, line graphs and dual hyperg... Read More about Line hypergraphs: A survey.

The Ratio of the Irredundance Number and the Domination Number for Block-Cactus Graphs (1998)
Journal Article

Let γ(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc. 9th Southeast Conf. on Combin., Graph Theory & Comp. (1978) 43-56] and Bollobás and Cockayne [J. Graph Theory (1979) 241-2... Read More about The Ratio of the Irredundance Number and the Domination Number for Block-Cactus Graphs.