Sciweavers

53 search results - page 2 / 11
» Spectral Densest Subgraph and Independence Number of a Graph
Sort
View
JCT
2007
146views more  JCT 2007»
13 years 6 months ago
Laplacian spectral bounds for clique and independence numbers of graphs
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
Mei Lu, Huiqing Liu, Feng Tian
IM
2007
13 years 6 months ago
The Spectral Gap of a Random Subgraph of a Graph
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
Fan R. K. Chung, Paul Horn
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
14 years 11 days ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
CIKM
2009
Springer
14 years 24 days ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 6 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...