Browsing by Author "Rall, Douglas F."

Browsing by Author "Rall, Douglas F."

Sort by: Order: Results:

  • Hartnell, Bert L.; Rall, Douglas F. (Electronic Journal of Combinatorics, 2013-04-30)
    A graph is well-covered if every maximal independent set has the same cardinality, namely the vertex independence number. We answer a question of Topp and Volkmann (1992) and prove that if the Cartesian product of two ...

  • Brešar, Boštjan; Hartnell, Bert L.; Rall, Douglas F. (Attribution 3.0 International (CC BY 3.0), 2017-03-09)
    A set D of vertices in a graph G is called a dissociation set if every vertex in D has at most one neighbor in D. We call a graph G uniformly dissociated if all maximal dissociation sets are of the same cardinality. ...