3008 search results - page 29 / 602 » Independence in connected graphs |
87
Voted
DM
2008
15 years 22 days ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
59
Voted
ENDM
2006
15 years 21 days ago
2006
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks
105
click to vote
ICLA
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Connection matrices of graph parameters were first introduced by M. Freedman, L. Lov
100
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
115
Voted
ICOIN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...