Upper Bounds on the Order of a Clique of a Graph
Authors:
- A. T. AminAAA. T. Amin
- S. L. HakimiSHS. L. Hakimi
- 1 June 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 22 (4) , 569-573
Abstract
This note presents an upper bound on the order of a largest complete subgraph (a clique) of a graph. Other upper bounds are given and the relationship between this bound and an existing bound is discussed.Keywords
This publication has 5 references indexed in Scilit:
- ON EIGENVALUES AND COLORINGS OF GRAPHS, IIAnnals of the New York Academy of Sciences, 1970
- GRAPH THEORY1969
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967
- The Eigenvalues of a Graph and Its Chromatic NumberJournal of the London Mathematical Society, 1967
- On the theory of graphsColloquium Mathematicum, 1954