3008 search results - page 160 / 602 » Independence in connected graphs |
140
click to vote
EJC
2007
15 years 6 months ago
2007
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mi...
164
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
159
click to vote
DM
2006
15 years 6 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
166
click to vote
LAWEB
2006
IEEE
16 years 15 days ago
2006
IEEE
In this paper we study duplicates on the Web, using collections containing documents of all sites under the .cl domain that represent accurate and representative subsets of the We...
186
click to vote
DMTCS
2010
15 years 3 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...