Survival under random coverings of trees
type: Item
instance of: scholarly article
title: Survival under random coverings of trees
zbMATH Open document ID: 0647.05019
DOI: 10.1007/BF01864153
author: A. Meir
author: J. W. Moon
published in: Graphs and Combinatorics
publication date: 1988-01-01T00:00:00Z
review text: Let \(v_ 1,...,v_ n\) be a random ordering of the nodes of a rooted tree \(T_ n\). If N(v) denotes the set of consisting of node v and all nodes joined to v, the nodes in \(N(v_ 1)\cup...\cup N(v_ j)\) are called ``j-covered'' and the remaining nodes ``j-survivors''. In the paper the expected number s(n,j) of j-survivors in the trees \(T_ n\) in some given family \({\mathcal F}\) of rooted trees is studied, as well as the expected value \(c_ r(n)\) of the least integer j such that the root r of \(T_ n\) is j-covered. The investigations are motivated by some problems arising in the context of security considerations for communication networks.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 4055635
zbMATH Keywords: j-survivors
zbMATH Keywords: rooted trees
zbMATH Keywords: j-covered
reviewed by: Peter Kirschenhofer
MaRDI profile type: Publication
cites work: Q4333506
cites work: On Cayley's Formula for Counting Trees
cites work: Q5624436
cites work: Q4190671
cites work: Optimal K-secure graphs
cites work: Q5682013
cites work: Q3884154
cites work: Q5616724
cites work: On the Altitude of Nodes in Random Trees
cites work: Q3856784
cites work: The Multiplicative Process
cites work: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
cites work: Q5645344
full work available at URL: https://doi.org/10.1007/bf01864153
OpenAlex ID: W1966943651
description: scientific article; zbMATH DE number 4055635