๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The most vital edges of matching in a bipartite graph

โœ Scribed by Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
373 KB
Volume
23
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel Algorithm for Finding the Most
Parallel Algorithm for Finding the Most Vital Edge in Weighted Graphs
โœ Sudarshan Banerjee; Sanjeev Saxena ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 75 KB

Let G = (V, E) be a weighted undirected graph with n vertices and m edges; each edge e has a weight w(e) assigned to it. Let f(G) be the weight of a minimum spanning tree of G if G is connected; otherwise f(G) = โˆž. The most vital edge of G is an edge e such that f(Ge) โ‰ฅ f(G -eโ€ฒ) for every other edge

The chromaticity of complete bipartite g
The chromaticity of complete bipartite graphs with at most one edge deleted
โœ C. P. Teo; K. M. Koh ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 364 KB ๐Ÿ‘ 1 views

## Abstract Let __K(p, q), p โ‰ค q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ โ‰ฅ 2; and (2) the graph __K(p, q)__ โ€ __e__ obtained by del