CaltechAUTHORS
  A Caltech Library Service

Independent sets of maximal size in tensor powers of vertex-transitive graphs

Ku, Cheng Yeaw and McMillan, Benjamin B. (2009) Independent sets of maximal size in tensor powers of vertex-transitive graphs. Journal of Graph Theory, 60 (4). pp. 295-301. ISSN 0364-9024. https://resolver.caltech.edu/CaltechAUTHORS:20090409-145752274

[img] PDF - Published Version
Restricted to Repository administrators only
See Usage Policy.

97Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20090409-145752274

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 finite tensor powers of G, thus providing an affirmative answer to a question raised by Larose and Tardif (J Graph Theory 40(3) (2002), 162-171).


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1002/jgt.20359DOIUNSPECIFIED
http://www3.interscience.wiley.com/journal/122194051/abstractPublisherUNSPECIFIED
Additional Information:© 2009 Wiley Periodicals, Inc. Received: 16 November 2007; Revised: 4 August 2008. We thank the anonymous referees for their comments that helped us to make several improvements to this paper.
Subject Keywords:tensor graph powers; independent sets of maximal size; vertex-transitive
Issue or Number:4
Record Number:CaltechAUTHORS:20090409-145752274
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20090409-145752274
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:13912
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:17 Apr 2009 22:35
Last Modified:03 Oct 2019 00:45

Repository Staff Only: item control page