SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS
From MaRDI portal
Publication:5349307
DOI10.1017/S0269964814000138zbMath1370.05192OpenAlexW2092647795MaRDI QIDQ5349307
Publication date: 24 August 2017
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964814000138
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)
Related Items (max. 100)
A SPECTRUM OF SERIES–PARALLEL GRAPHS WITH MULTIPLE EDGE EVOLUTION ⋮ ON THE COMBINATORICS OF BINARY SERIES-PARALLEL GRAPHS ⋮ DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS ⋮ Combinatorial Analysis of Growth Models for Series-Parallel Networks
Cites Work
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- SOME NODE DEGREE PROPERTIES OF SERIES–PARALLEL GRAPHS EVOLVING UNDER A STOCHASTIC GROWTH MODEL
- Vertices of given degree in series-parallel graphs
- Limit laws for local counters in random binary search trees
- On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
- A random hierarchical lattice: the series-parallel graph and its properties
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
This page was built for publication: SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS
