✦ LIBER ✦

On the Weak Reconstruction of Strong Product Graphs

✍ Scribed by Blaž Zmazek; Janez Žerovnik

Book ID: 108498027
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 271 KB
Volume: 13
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00452-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the weak reconstruction of Cartesian-

On the weak reconstruction of Cartesian-product graphs

✍ Wilfried Imrich; Janez Ẑerovnik 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 590 KB

Weak k-reconstruction of cartesian produ

Weak k-reconstruction of cartesian product graphs

✍ Wilfried Imrich; Blaž Zniazek; Janez Zerovnik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 203 KB

The strong distance problem on the Carte

The strong distance problem on the Cartesian product of graphs

✍ Justie Su-Tzu Juan; Chun-Ming Huang; I-fan Sun 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Numerical invariants and the strong prod

Numerical invariants and the strong product of graphs

✍ R.S Hales 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Strong perfectness of the generalized Ca

Strong perfectness of the generalized Cartesian product of graphs

✍ Maria Kwaśnik; Alina Szelecka 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 367 KB

In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect. The special case of the result is the known theorem concerning the Cartesian product of two graphs.

Strong products of Kneser graphs

✍ Sandi Klavžar; Uroš Milutinović 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Let G [XI H be the strong product of graphs G and H. We give a short proof that Kneser graphs are then used to demonstrate that this lower bound is sharp. We also prove that for every n > 2 there is an infinite sequence of pairs of graphs G and G' such that G' is not a retract of G while G' IXI K,