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

On graphs with randomly deleted edges

โœ Scribed by A. K. Kelmans

Publisher
Akadmiai Kiad
Year
1981
Tongue
English
Weight
560 KB
Volume
37
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On randomly -dimensional graphs
On randomly -dimensional graphs
โœ Mohsen Jannesari; Behnaz Omoomi ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

## a b s t r a c t For an ordered set W = {w 1 , w 2 , . . . , w k } of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W representation of v with respect to W , where d(x, y) is the distance between the vertices x and y. The set W is called a resolving set for G if disti

On randomly Hamiltonian graphs
On randomly Hamiltonian graphs
โœ Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Springer ๐ŸŒ English โš– 801 KB
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

Properties of edge-deleted distance stab
Properties of edge-deleted distance stable graphs
โœ Klemm, Karen; Winters, Steven J. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 72 KB ๐Ÿ‘ 2 views

The distance from a vertex u to a vertex v in a connected graph G is the length of a shortest u-v path in G. The distance of a vertex v of G is the sum of the distances from v to the vertices of G. For a vertex v in a 2-edge-connected graph G, we define the edge-deleted distance of v as the maximum