On the distribution in a graph process

DOI10.1016/0012-365X(84)90057-8MaRDI QIDQ795841zbMATH OpenFDO

Authors B. R. Handa, S. G. Mohanty

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(84)90057-8

zbMATH Keywords

lattice path countingrandom walk

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Paths and cycles (05C38) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 3173143
• A forest building process on simple graphs
• The degree sequence of a scale-free random graph process
• scientific article; zbMATH DE number 3168330
• Random graph processes with maximum degree 2

Cited in

(10)

• A triangle process on regular graphs
• Impulsive processes on the weighted directed graphs
• scientific article; zbMATH DE number 6501135 (Why is no real title available?)
• scientific article; zbMATH DE number 4004456 (Why is no real title available?)
• scientific article; zbMATH DE number 4109789 (Why is no real title available?)
• scientific article; zbMATH DE number 568787 (Why is no real title available?)
• scientific article; zbMATH DE number 7045671 (Why is no real title available?)
• An averaging process on hypergraphs
• scientific article; zbMATH DE number 2201982 (Why is no real title available?)
• A transport process on graphs and its limiting distributions

This page was built for publication: On the distribution in a graph process

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