A random intersection digraph: indegree and outdegree distributions

DOI10.1016/j.disc.2010.06.018zbMath1210.05156OpenAlexW2049782287MaRDI QIDQ708428

Mindaugas Bloznelis

Publication date: 11 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.018

zbMATH Keywords

clusteringdegree distributionrandom intersection graphrandom intersection digraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Degree distribution of an inhomogeneous random intersection graph ⋮ Degree and clustering coefficient in sparse random intersection graphs ⋮ A note on hamiltonicity of uniform random intersection graphs ⋮ A classification of isomorphism-invariant random digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Degree distribution of a typical vertex in a general random intersection graph
• Connectivity of the uniform random intersection graph
• Connection digraphs and second-order line digraphs
• The degree of a typical vertex in generalized random intersection graph models
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• On Random Intersection Graphs: The Subgraph Problem
• The vertex degree distribution of random intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Digraphs

This page was built for publication: A random intersection digraph: indegree and outdegree distributions