Downloadable Content

Download PDF
Article

The well-covered dimension of products of graphs

We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found,provided that G has a largest greedy independent decomposition of length c n.
Date
  • 2014
Resource Type
Creator
Campus
Publisher
Subjects
Keywords
Date Copyright
  • 2014
Date Accessioned
  • 2016-10-14T20:52:58Z
Handle
Identifier
DOI
["Made available in DSpace on 2016-10-14T20:52:58Z (GMT). No. of bitstreams: 1 The well-covered dimension of products of graphs.pdf: 271836 bytes, checksum: 5d0bc7374329a0b6b5f4236ee5d8d324 (MD5) Previous issue date: 2014", "Submitted by Tiewei Liu (tieweil@csufresno.edu) on 2016-10-14T20:52:58Z No. of bitstreams: 1 The well-covered dimension of products of graphs.pdf: 271836 bytes, checksum: 5d0bc7374329a0b6b5f4236ee5d8d324 (MD5)"]
Language
Notes
Thumbnail Title Date Uploaded Visibility Actions
file details The_well-covered_dimension_of_products_of_graphs.pdf 2020-06-01 Public Download

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.