𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convex Sets in Lexicographic Products of Graphs

✍ Scribed by Bijo S. Anand; Manoj Changat; Sandi Klavžar; Iztok Peterin

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
162 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unretractive and S-unretractive joins an
Unretractive and S-unretractive joins and lexicographic products of graphs
✍ Ulrich Knauer 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 515 KB

Graphs without proper endomorphisms are the subject of this article. It is shown that the join of two graphs has this property if and only if both summands have it, and that the lexicographic product of a complete graph or an odd circuit as first factors has this property if and only if the second f

Counting stable sets on Cartesian produc
Counting stable sets on Cartesian products of graphs
✍ Florence Forbes; Bernard Ycart 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

We study the generating functions for the number of stable sets of all cardinalities, in the case of graphs which are Cartesian products by paths, cycles, or trees. Explicit results are given for products by cliques. Algorithms based on matrix products are derived for grids, cylinders, toruses and h