David Tankus

activity

20092024

most citedWeighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.DM2014

Well-dominated graphs without cycles of lengths 4 and 5

Vadim E. Levit, David Tankus

Let $G$ be a graph. A set $S$ of vertices in $G$ dominates the graph if every vertex of $G$ is either in $S$ or a neighbor of a vertex in $S$ . Finding a minimal cardinality set whi…

cs.DM2014

Complexity results for generating subgraphs

Vadim E. Levit, David Tankus

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if a…