On graphs with randomly deleted edges-Reference-Cited by-同舟云学术

On graphs with randomly deleted edges

Published:1981-03 Issue:1-3 Volume:37 Page:77-88
ISSN:0001-5954
Container-title:Acta Mathematica Academiae Scientiarum Hungaricae
language:en
Short-container-title:Acta Mathematica Academiae Scientiarum Hungaricae

Author:

Kelmans A. K.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF01904874.pdf

Reference19 articles.

1. A. Rényi, Some remarks on the theory of trees,Publ. Math. Inst. Hung. Acad. Sci.,4 (1959), 73–85.

2. P. Erdős andA. Rényi, On the evolution of random graphs,Publ. Math. Inst. Hung. Acad. Sci.,5 (1960), 17–61.

3. A. K. Kelmans, On the connectedness of random graphs,Avtomatika i Telemehanika (translated asAutomation and Remote Control),28 (1967), 98–116.

4. V. E. Stepanov, Combinatorial algebra and random graphs,Teoriya veroyatnostei i ee primeneniya,14 (1969), 393–420.

5. A. K. Kelmans, Asymptotic formulas for the probability ofk-connectedness of random graphs,Teoriya veroyatnosteí i ee primeneniya,17 (1972), 253–265.

Cited by 63 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the construction of locally most reliable two-terminal graphs;Discrete Applied Mathematics;2024-10

2. Complete signed graphs with largest maximum or smallest minimum eigenvalue;Discrete Mathematics;2024-04

3. Greedy maximal independent sets via local limits;Random Structures & Algorithms;2023-12-18

4. On maximum graphs in Tutte polynomial posets;Discrete Applied Mathematics;2023-11

5. The Number of Cliques in Graphs Covered by Long Cycles;SIAM Journal on Discrete Mathematics;2023-06-12