A note on hamiltonicity of uniform random intersection graphs
From MaRDI portal
Publication:647151
DOI10.1007/S10986-011-9115-7zbMATH Open1226.05226OpenAlexW2004158170MaRDI QIDQ647151FDOQ647151
Mindaugas Bloznelis, Irmantas Radavičius
Publication date: 1 December 2011
Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10986-011-9115-7
Cites Work
- On Random Intersection Graphs: The Subgraph Problem
- Connectivity of the uniform random intersection graph
- On Hamiltonicity of uniform random intersection graphs
- The vertex degree distribution of random intersection graphs
- Poisson Approximation of the Number of Cliques in Random Intersection Graphs
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Component evolution in a secure wireless sensor network
- Automata, Languages and Programming
- Component Evolution in General Random Intersection Graphs
- Degree distributions in general random intersection graphs
- The degree of a typical vertex in generalized random intersection graph models
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- A random intersection digraph: indegree and outdegree distributions
- On the independence number and Hamiltonicity of uniform random intersection graphs
Cited In (5)
Recommendations
- On Hamiltonicity of uniform random intersection graphs 👍 👎
- Automata, Languages and Programming 👍 👎
- On the independence number and Hamiltonicity of uniform random intersection graphs 👍 👎
- Selected Combinatorial Properties of Random Intersection Graphs 👍 👎
- Finding Hamilton cycles in random intersection graphs 👍 👎
This page was built for publication: A note on hamiltonicity of uniform random intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647151)