Random Accessibility as a Parallelism to Reliability Studies on Simple Graphs

From MaRDI portal





Families of simple graphs are considered defined by their number of vertices and their number of edges. Starting in vertex \(v_1\), let \(X\) be the number of random transitions needed to visit \(J-1\) further vertices of the graph where ``random means that each edge emanating from a vertex has equal probability. The analysis of this kind of random walks within a graph is known as ``random accessibility. For 10 families the expectations and variances of \(X\) are determined and used for verifying two conjectures which serve to show the relation between accessibility and reliability of a graph.











This page was built for publication: Random Accessibility as a Parallelism to Reliability Studies on Simple Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460672)