• English
    • français
  • English 
    • English
    • français
View Item 
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • James D. Currie
  • View Item
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • James D. Currie
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Characterization of Fractionally Well-Covered Graphs

Thumbnail

View Open

A characterization of fractionally well-covered graphs.pdf (1.975Mb)

Metadata

Show full item record

Author

Currie, James
Nowakowski, Richard

Uri

http://hdl.handle.net/10680/1701

Date

1991

Citation

Currie, James, and Richard Nowakowski. "A Characterization of Fractionally Well-Covered Graphs." Ars Combinatoria 31 (1991): 93-96.

Abstract

A graph is called well-covered if every maximal independent set has the same size. One generalization of independent sets in graphs is that of a fractional cover -- attach nonnegative weights to the vertices and require that for every vertex the sum of all the weights in its closed neighbourhood be at least 1. In this paper we consider and characterize fractionally well-covered graphs.

Collections

  • James D. Currie
  • Richard Nowakowski

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Report a copyright concern

Contact Us | Send Feedback