A note on strong and co-strong perfectness of the X-join of graphs
Discussiones Mathematicae Graph Theory (1996)
- Volume: 16, Issue: 2, page 151-155
- ISSN: 2083-5892
Access Full Article
top
Abstract
topHow to cite
topAlina Szelecka, and Andrzej Włoch. "A note on strong and co-strong perfectness of the X-join of graphs." Discussiones Mathematicae Graph Theory 16.2 (1996): 151-155. <http://eudml.org/doc/270622>.
@article{AlinaSzelecka1996,
abstract = {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 andD. Basavayya [5]. In this paper we discuss strong perfectness and co-strong perfectness for the generalized composition (the lexicographic product) of graphs named as the X-join of graphs.},
author = {Alina Szelecka, Andrzej Włoch},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {strongly perfect graphs; co-strongly perfect graphs; the X-join of graphs; strong perfectness; co-strong perfectness; -join of graphs},
language = {eng},
number = {2},
pages = {151-155},
title = {A note on strong and co-strong perfectness of the X-join of graphs},
url = {http://eudml.org/doc/270622},
volume = {16},
year = {1996},
}
TY - JOUR
AU - Alina Szelecka
AU - Andrzej Włoch
TI - A note on strong and co-strong perfectness of the X-join of graphs
JO - Discussiones Mathematicae Graph Theory
PY - 1996
VL - 16
IS - 2
SP - 151
EP - 155
AB - 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 andD. Basavayya [5]. In this paper we discuss strong perfectness and co-strong perfectness for the generalized composition (the lexicographic product) of graphs named as the X-join of graphs.
LA - eng
KW - strongly perfect graphs; co-strongly perfect graphs; the X-join of graphs; strong perfectness; co-strong perfectness; -join of graphs
UR - http://eudml.org/doc/270622
ER -
References
top- [1] C. Berge and P. Duchet, Strongly perfect graphs, Ann. Disc. Math. 21 (1984) 57-61. Zbl0558.05037
- [2] M. Borowiecki and A. Szelecka, One factorizations of the generalized Cartesian product and of the X-join of regular graphs, Discussiones Mathematicae 13 (1993) 15-19. Zbl0794.05099
- [3] M. Kwaśnik and A. Szelecka, Strong perfectness of the generalized Cartesian product of graphs, accepted for publication in the special issue of Discrete Math., devoted to the Second Krako w Conference on Graph Theory, Zakopane 1994. Zbl0870.05027
- [4] E. Mandrescu, Strongly perfect product of graphs, Czech. Math. Journal, 41 (116) (1991) 368-372. Zbl0738.05073
- [5] G. Ravindra and D. Basavayya, Co-strongly perfect bipartite graphs, Jour. Math. Phy. Sci. 26 (1992) 321-327. Zbl0771.05086
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.