✦ LIBER ✦

Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs

✍ Scribed by Litao Guo; Weihua Yang; Xiaofeng Guo

Book ID: 119188046
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 204 KB
Volume: 26
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.04.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Powers of cycles, powers of paths, and d

Powers of cycles, powers of paths, and distance graphs

✍ Min Chih Lin; Dieter Rautenbach; Francisco Juan Soulignac; Jayme Luiz Szwarcfite 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 245 KB

On the super connectivity of Kronecker p

On the super connectivity of Kronecker products of graphs

✍ Hechao Wang; Erfang Shan; Wei Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Connectivity of Kronecker products with

Connectivity of Kronecker products with complete multipartite graphs

✍ Wang, Wei; Yan, Zhidan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 358 KB

Snakes in Powers of Complete Graphs

✍ H. L. Abbott and P. F. Dierker 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 704 KB

Snakes in Powers of Complete Graphs

✍ Abbott, H. L.; Dierker, P. F. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 867 KB

Powers of Hamiltonian paths in interval

Powers of Hamiltonian paths in interval graphs

✍ Isaak, Garth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB 👁 3 views

We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We wi