Abstract
Binary series-parallel (BSP) graphs have applications in transportation modeling, and exhibit interesting combinatorial properties. This work is limited to the second aspect. The BSP graphs of a given size – measured in edges – are enumerated. Under a uniform probability model, we investigate the asymptotic distribution of the order (number of vertices) and the asymptotic average length of a random walk (under different strategies) of large graphs of the same size. The systematic method throughout is to define the graphs, and the features we evaluate by a structural equation (equivalent to a regular expression). The structural equation is translated into an equation for a generating function, which is then analyzed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
