✦ LIBER ✦

The -labeling on Cartesian sum of graphs

✍ Scribed by Zhendong Shao; David Zhang

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 354 KB
Volume: 21
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2007.08.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic number of the lexicogra

On the chromatic number of the lexicographic product and the Cartesian sum of graphs

✍ Niko Čižek; Sandi Klavžar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 449 KB

Games on the sum of graphs

✍ L. P. Varvak 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 293 KB

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

On super connectivity of Cartesian produ

On super connectivity of Cartesian product graphs

✍ Min Lü; Chao Wu; Guo-Liang Chen; Cheng Lv 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

On Consecutive labeling of plane graphs

✍ Martin Bac̆a 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 219 KB

This paper concerns a labeling problem of the plane graphs P,,. The present paper describes a nqic vertex labeling and a consecutive labeling ef type (0, I, I). These labelings combine to a consecutice labeling qf type (I, I, I).

A Note on Labeling of Graphs

✍ Baoguang Xu; Zhenhong Liu; Taro Tokuda 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 72 KB