Pages that link to "Item:Q5672659"

The following pages link to Upper Bounds on the Order of a Clique of a Graph (Q5672659):

Displaying 11 items.

• Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues (Q405284) (← links)
• Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
• Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
• Some observations on the determination of an upper bound for the clique number of a graph (Q1220089) (← links)
• The maximum clique problem (Q1318271) (← links)
• Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
• Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph (Q2013183) (← links)
• More eigenvalue problems of Nordhaus-Gaddum type (Q2451210) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• Graph Limits and Spectral Extremal Problems for Graphs (Q6188518) (← links)