✦ LIBER ✦

Proof of a conjecture on connectivity of Kronecker product of graphs

✍ Scribed by Yun Wang; Baoyindureng Wu

Book ID: 113567340
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 188 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.06.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the connectivity of Kronecker

A note on the connectivity of Kronecker products of graphs

✍ Raxida Guji; Elkin Vumar 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Let κ(G) be the connectivity of G. The Kronecker product where G is a bipartite graph.

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

Proof of conjectures involving algebraic

Proof of conjectures involving algebraic connectivity of graphs

✍ Das, Kinkar Ch. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 388 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

Proof of Mader's conjecture on k-critica

Proof of Mader's conjecture on k-critical n-connected graphs

✍ Su Jianji 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract Mader conjectured that every __k__‐critical __n__‐connected noncomplete graph __G__ has __2k__ + 2 pairwise disjoint fragments. The author in 9 proved that the conjecture holds if the order of __G__ is greater than (__k__ + 2)__n__. Now we settle this conjecture completely. © 2004 Wiley

The Kronecker product of graphs

✍ Weichsel, Paul M. 📂 Article 📅 1962 🏛 American Mathematical Society 🌐 English ⚖ 481 KB