z-logo
Premium
Chain Lengths in Certain Random Directed Graphs
Author(s) -
Newman Charles M.
Publication year - 1992
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240030304
Subject(s) - combinatorics , mathematics , vertex (graph theory) , bounded function , path (computing) , random graph , zero (linguistics) , directed graph , graph , constant (computer programming) , discrete mathematics , mathematical analysis , computer science , linguistics , philosophy , programming language
We study the random directed graph with vertex set {1, …, n } in which the directed edges ( i, j ) occur independently with probability c n /n for i

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom