𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independent sets in tensor graph powers

✍ Scribed by Alon, Noga (author);Lubetzky, Eyal (author)


Publisher
Wiley-Liss Inc.
Year
2006
Tongue
English
Weight
154 KB
Volume
54
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Independent sets in tensor graph powers
✍ Alon, Noga (author);Lubetzky, Eyal (author) πŸ“‚ Article πŸ“… 2006 πŸ› Wiley-Liss Inc. 🌐 English βš– 154 KB

## Abstract The tensor product of two graphs, __G__ and __H__, has a vertex set __V__(__G__) Γ— __V__(__H__) and an edge between (__u__,__v__) and (__u__β€²,__v__β€²) iff both __u__ __u__β€² ∈ __E__(__G__) and __v__ __v__β€² ∈ __E__(__H__). Let __A__(__G__) denote the limit of the independence ratios of ten

Independent sets in tensor graph powers
✍ Alon, Noga (author);Lubetzky, Eyal (author) πŸ“‚ Article πŸ“… 2006 πŸ› Wiley-Liss Inc. 🌐 English βš– 154 KB
Independent sets in tensor graph powers
✍ Alon, Noga (author);Lubetzky, Eyal (author) πŸ“‚ Article πŸ“… 2006 πŸ› Wiley-Liss Inc. 🌐 English βš– 154 KB
Independent sets of maximal size in tens
✍ Cheng Yeaw Ku; Benjamin B. McMillan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 97 KB πŸ‘ 2 views

## Abstract Let __G__ be a connected, nonbipartite vertex‐transitive graph. We prove that if the only independent sets of maximal cardinality in the tensor product __G__ Γ— __G__ are the preimages of the independent sets of maximal cardinality in __G__ under projections, then the same holds for all

Projectivity and independent sets in pow
✍ Benoit Larose; Claude Tardif πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 95 KB πŸ‘ 1 views

## Abstract We investigate the relationship between projectivity and the structure of maximal independent sets in powers of circular graphs, Kneser graphs and truncated simplices. Β© 2002 Wiley Periodicals, Inc. J Graph Theory 40: 162–171, 2002

Maximal independent sets in bipartite gr
✍ Jiuqiang Liu πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 458 KB πŸ‘ 1 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as