Sciweavers

Share
14 search results - page 1 / 3
» New Bounds on the Clique Number of Graphs Based on Spectral ...
Sort
View
LION
2009
Springer
125views Optimization» more  LION 2009»
12 years 8 months ago
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Samuel Rota Bulò, Marcello Pelillo
JCT
2007
146views more  JCT 2007»
12 years 1 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
LION
2007
Springer
138views Optimization» more  LION 2007»
12 years 7 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
CORR
2008
Springer
129views Education» more  CORR 2008»
12 years 1 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
DCC
2005
IEEE
13 years 1 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
books