Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

On the number of cycles in a random non-equiprobable graph

  • V. F. KOLCHIN and V. I. KHOKHLOV
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1992.2.1.109
Published Online: 2009-10-09
Published in Print: 1992

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 2 Issue 1

Journal and Issue

Articles in the same Issue

On the edge-independence number and edge-covering number for regular graphs
Systems of antiprefix equations in words
On word colourings and some perfect graphs
Optimal search of extremums of convex functions on lattices
The completeness modulo ideal in functional systems of a program type
On the solution of systems of automaton equations
Some conditional distributions for random graphs
Randomized decomposable statistics in the scheme of independent allocating particles into boxes
On the number of cycles in a random non-equiprobable graph
Downloaded on 7.5.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1992.2.1.109/html
Scroll to top button