A note on strong and co-strong perfectness of the X-join of graphs | Zendy

Alina Szelecka | Zendy; Andrzej Włoch | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A note on strong and co-strong perfectness of the X-join of graphs

Author(s) -

Alina Szelecka,

Andrzej Włoch

Publication year - 1996

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1030

Subject(s) - join (topology) , mathematics , combinatorics , discrete mathematics

Strongly perfect graphs were introduced by C. Berge and P. Duchet in [1]. In [4], [3] the following was studied: the problem of strong perfectness for the Cartesian product, the tensor product, the symmetrical difference of n, n ≥ 2, graphs and for the generalized Cartesian product of graphs. Co-strong perfectness was first studied by G. Ravindra and D. Basavayya [5]. In this paper we discuss strong perfectness and costrong perfectness for the generalized composition (the lexicographic product) of graphs named as the X-join of graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research