On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs.
Jun ZhaoOsman YaganVirgil D. GligorPublished in: CoRR (2014)
Keyphrases
- undirected graph
- directed graph
- spanning tree
- strongly connected
- random graphs
- attributed graphs
- labeled graphs
- connected components
- hamiltonian cycle
- connected subgraphs
- minimum weight
- minimum cost
- edge weights
- degree distribution
- maximum cardinality
- triangle mesh
- minimum length
- graph mining
- graph theory
- social networks
- graph data
- minimum spanning tree
- vertex set
- uniformly distributed
- connected dominating set
- topological information
- graph theoretic
- graph partitioning
- graph model
- weighted graph
- graph structure
- bipartite graph
- graph matching
- graphical models
- d objects