Results 1 
3 of
3
Exact Bounds on the order of the maximum clique of a graph
, 2003
"... The paper reviews some of the existing exact bounds to the maximum clique of a graph and successivel presents a new upper and a newlwx, bound. The new upper bound is rank # A=2, where # A is the adjacency matrix of the compljWxyjkV graph, and derives from a formuly,G8 of the maximumclimu ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The paper reviews some of the existing exact bounds to the maximum clique of a graph and successivel presents a new upper and a newlwx, bound. The new upper bound is rank # A=2, where # A is the adjacency matrix of the compljWxyjkV graph, and derives from a formuly,G8 of the maximumclimu problm incompl9 space. The newlwxj bound is ! 1=(1 g j # (# # )) (see text fordetail8 and improves strictl the present best lstx bound publdxWW byWil (J. Combin. Theory Ser. B 40 (1986) 113). Throughout
Computers and Discovery in Algebraic Graph Theory
 Edinburgh, 2001), Linear Algebra Appl
, 2001
"... We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.