✦ LIBER ✦

A note on “Tenacity of a graph with maximum connectivity”

✍ Scribed by Shirdel, G.H.; Vaez-Zadeh, B.

Book ID: 122743389
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 338 KB
Volume: 166
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.06.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Maximum Connectivity of a Graph

✍ Frank Harary 📂 Article 📅 1962 🏛 National Academy of Sciences 🌐 English ⚖ 215 KB

A note on the maximum genus of 3-edge-co

A note on the maximum genus of 3-edge-connected nonsimple graphs

✍ Huang Yuanqiu 📂 Article 📅 2000 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 229 KB

A note on labeling schemes for graph con

A note on labeling schemes for graph connectivity

✍ Rani Izsak; Zeev Nutov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Constructing a bipartite graph of maximu

Constructing a bipartite graph of maximum connectivity with prescribed degrees

✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and

The Maximum Genus of a Graph with Given

The Maximum Genus of a Graph with Given Diameter and Connectivity

✍ Humg-Lin Fu; Ming-Chun Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 299 KB

The Maximum Genus of a Graph with Given

The Maximum Genus of a Graph with Given Diameter and Connectivity

✍ Hung-Lin Fu; Ming-Chun Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 354 KB