𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper Bounds on the Order of a Clique of a Graph

✍ Scribed by A. T. Amin and S. L. Hakimi

Book ID
124881235
Publisher
Society for Industrial and Applied Mathematics
Year
1972
Tongue
English
Weight
440 KB
Volume
22
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, Ο‰(__G__), of a maximum clique in __G__ sat

An upper bound on the size of the larges
An upper bound on the size of the largest cliques in a graph
✍ Alain Billionnet πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 194 KB πŸ‘ 1 views

## Abstract We produce in this paper an upper bound for the number of vertices existing in a clique of maximum cardinal. The proof is based in particular on the existence of a maximum cardinal clique that contains no vertex __x__ such that the neighborhood of __x__ is contained in the neighborhood

The Order Upper Bound on Parity Embeddin
The Order Upper Bound on Parity Embedding of a Graph
✍ Thomas Zaslavsky πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 398 KB

A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according to whether its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is the Euler characteristic) over all surfaces S in which 1 can be parity embedde