𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimal cost maximum matching of a graph (supplementary remarks)

✍ Scribed by H. Müller-Merbach

Publisher
Springer
Year
1971
Tongue
English
Weight
141 KB
Volume
15
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum number of edges in a minimal
The maximum number of edges in a minimal graph of diameter 2
✍ Zoltán Füredi 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph

A remark on the number of vertices of de
A remark on the number of vertices of degree k in a minimally k-edge-connected graph
✍ Mao-cheng Cai 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v