3 citations · 4 across the 19 of their papers we have counts for
4 papers · 1 filter
On well-dominated graphs
Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall
A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian produ…
Graphs in which all maximal bipartite subgraphs have the same order
Wayne Goddard, Kirsti Kuenzel, Eileen Melville
Motivated by the concept of well-covered graphs, we define a graph to be well-bicovered if every vertex-maximal bipartite subgraph has the same order (which we call the bipartite n…
Graphs with a unique maximum open packing
Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall
A set of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in are disjoint. In this paper, we consider the graphs that have a uniq…
On well-covered direct products
Kirsti Kuenzel, Douglas F. Rall
A graph is well-covered if all maximal independent sets of have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have…