G-2007-33
Variable Neighborhood Search for Extremal Graphs. 24. Conjectures and Results About the Clique Number
, , , and BibTeX reference
A set of vertices S in a graph G is a clique if any two of its vertices are adjacent.
The clique number is the maximum cardinality of a clique in G. A series of best
possible lower and upper bounds on the difference, sum, ratio or product of
and
some other common invariants of G were obtained by the system AGX 2, and most
of them proved either automatically or by hand. In the present paper, we report on
such lower and upper bounds considering, as second invariant, minimum, average and
maximum degree, algebraic, node and edge connectivity, index, average distance, remoteness, radius and diameter.
Published May 2007 , 30 pages
Research Axis
Research applications
Publication
Jan 2010
Variable neighborhood search for extremal graphs. 24. Conjectures and results about the clique number
, , , and
Studia Informatica Universalis, 8(2), 281–316, 2010
BibTeX reference