Isoperimetric numbers of randomly perturbed intersection graphs
From MaRDI portal
Publication:2337904
DOI10.3390/sym11040452zbMath1425.05144OpenAlexW2934249881WikidataQ128124436 ScholiaQ128124436MaRDI QIDQ2337904
Publication date: 20 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym11040452
Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Graph-theoretic design and analysis of key predistribution schemes
- Expansion of random graphs: new proofs, new results
- The chromatic number of random intersection graphs
- The isoperimetric number of random regular graphs
- Renormalization group analysis of the small-world network model
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs
- Joint probability generating function for degrees of active/passive random intersection graphs
- Degree distributions in general random intersection graphs
- Bipartite structure of all complex networks
- On tree width, bramble size, and expansion
- Isoperimetric numbers of graphs
- From the Cover: The structure of scientific collaboration networks
- Smoothed Analysis on Connected Graphs
- Introduction to Random Graphs
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- On smoothed analysis in dense graphs and formulas
- Coloring complete bipartite graphs from random lists
- Expander graphs and their applications
- On Random Intersection Graphs: The Subgraph Problem
- On the Edge-Expansion of Graphs
- Adding random edges to dense graphs
- How many random edges make a dense graph hamiltonian?
- Tilings in Randomly Perturbed Dense Graphs
- The Mixing Time of the Newman-Watts Small-World Model
- On Connectivity and Robustness in Random Intersection Graphs
- Collective dynamics of ‘small-world’ networks
- The isoperimetric constant of the random graph process
- Sur deux propriétés des classes d'ensembles
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- Networks
This page was built for publication: Isoperimetric numbers of randomly perturbed intersection graphs
