On Some Combinatorial Properties of Random Intersection Graphs

DOI10.1007/978-3-319-24024-4_21zbMATH Open1331.05199OpenAlexW2407321885MaRDI QIDQ3464482FDOQ3464482

Authors: Christoforos L. Raptopoulos, Sotiris E. Nikoletseas 

Publication date: 27 January 2016

Published in: Algorithms, Probability, Networks, and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24024-4_21

Recommendations

• Selected Combinatorial Properties of Random Intersection Graphs
• Publication:4729111
• The intersection graph of random sets
• Selected combinatorial problems through the prism of random intersection graphs models
• The chromatic number of random intersection graphs
• On Connectivity in a General Random Intersection Graph
• On randomly generated intersecting hypergraphs
• On the interval number of random graphs
• A guided tour in random intersection graphs
• On Random Intersection Graphs: The Subgraph Problem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• On Random Intersection Graphs: The Subgraph Problem
• Graph colouring and the probabilistic method
• On the complexity of the herding attack and some related attacks on hash functions
• On the independence number of random graphs
• Equivalence of a random intersection graph and G (n ,p )
• Colouring Non-sparse Random Intersection Graphs
• 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
• Coloring Random Intersection Graphs and Complex Networks
• Component evolution in a secure wireless sensor network
• Large independent sets in general random intersection graphs
• The chromatic number of random graphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Zero–One Laws for Connectivity in Random Key Graphs
• The cover time of sparse random graphs
• On the independence number and Hamiltonicity of uniform random intersection graphs
• Expander properties and the cover time of random intersection graphs
• On the isolated vertices and connectivity in random intersection graphs
• Algorithms and Computation
• Sharp thresholds for Hamiltonicity in random intersection graphs
• Maximum cliques in graphs with small intersection number and random intersection graphs

Cited In (14)

• Equivalence of a random intersection graph and G (n ,p )
• A random intersection digraph: indegree and outdegree distributions
• Selected Combinatorial Properties of Random Intersection Graphs
• Isoperimetric numbers of randomly perturbed intersection graphs
• The threshold for combs in random graphs
• Recognizing random intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Connectivity of the uniform random intersection graph
• Intersections of random hypergraphs and tournaments
• The intersection graph of random sets
• On Random Intersection Graphs: The Subgraph Problem
• On randomly generated intersecting hypergraphs
• Selected combinatorial problems through the prism of random intersection graphs models
• Component evolution in general random intersection graphs

This page was built for publication: On Some Combinatorial Properties of Random Intersection Graphs

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