Title
Independent sets in tensor graph powers
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 tensor powers of G, lim, α(Gn)-|V(Gn)|. This parameter was introduced in [Brown, Nowakowski, Rall, SIAM J Discrete Math 9 (1996), 290–300], where it was shown that A(G) is lower bounded by the vertex expansion ratio of independent sets of G. In this article we study the relation between these parameters further, and ask whether they are in fact equal. We present several families of graphs where equality holds, and discuss the effect the above question has on various open problems related to tensor graph products. © 2006 Wiley Periodicals, Inc. J Graph Theory
Year
DOI
Venue
2007
10.1002/jgt.v54:1
Journal of Graph Theory
Keywords
Field
DocType
independent set,tensor product,lower bound
Topology,Discrete mathematics,Circulant graph,Combinatorics,Bound graph,Graph power,Vertex (graph theory),Neighbourhood (graph theory),Degree (graph theory),Symmetric graph,Covering graph,Mathematics
Journal
Volume
Issue
ISSN
54
1
0364-9024
Citations 
PageRank 
References 
20
1.39
7
Authors
2
Name
Order
Citations
PageRank
Noga Alon1104681688.16
Eyal Lubetzky235528.87