3 citations · 4 across the 19 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Orientable total domination in graphs
Sarah E. Anderson, Tanja Dravec, Daniel Johnston +1
Given a directed graph , a set is a total dominating set of if each vertex in has an in-neighbor in . The total domination number of , denoted $…
math.CO2023
The number of independent sets in bipartite graphs and benzenoids
Michael Han, Sycamore Herlihy, Kirsti Kuenzel +2
Given a graph , we study the number of independent sets in , denoted . This parameter is known as both the Merrifield-Simmons index of a graph as well as the Fibonacci…
math.CO2023
A characterization of well-dominated Cartesian products
Kirsti Kuenzel, Douglas F. Rall
A graph is well-dominated if all its minimal dominating sets have the same cardinality. In this paper we prove that at least one factor of every connected, well-dominated Cartesian…