On the distribution in a graph process

DOI10.1016/0012-365X(84)90057-8zbMATH Open0543.05040MaRDI QIDQ795841FDOQ795841

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

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random walklattice path counting

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• A triangle process on regular graphs
• Title not available (Why is that?)
• A transport process on graphs and its limiting distributions
• Impulsive processes on the weighted directed graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An averaging process on hypergraphs
• Title not available (Why is that?)

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)