Upper Bounds on the Order of a Clique of a Graph

DOI10.1137/0122052zbMath0258.05110OpenAlexW1978845953MaRDI QIDQ5672659

Ashok T. Amin, S. Louis Hakimi

Publication date: 1972

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0122052

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (14)

A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ A global optimization approach for solving the maximum clique problem ⋮ Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues ⋮ Graph Limits and Spectral Extremal Problems for Graphs ⋮ More eigenvalue problems of Nordhaus-Gaddum type ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ Block linear majorants in quadratic 0--1 optimization ⋮ Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ Some observations on the determination of an upper bound for the clique number of a graph ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ Exact bounds on the order of the maximum clique of a graph. ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ The largest eigenvalue of a graph: A survey ⋮ The maximum clique problem

This page was built for publication: Upper Bounds on the Order of a Clique of a Graph