L. Teshima

activity

20142023

most citedA note on some variations of the

γ

-graph

2 citations · 3 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2023

The $i$ -Graphs of Paths and Cycles

R. C. Brewster, C. M. Mynhardt, L. E. Teshima

The independent domination number $i (G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$ , also called an $i (G)$ -set. The $i$ -graph of $G$ , denoted $\m…

math.CO2023

Reconfiguration of Minimum Independent Dominating Sets in Graphs

R. C. Brewster, C. M. Mynhardt, L. E. Teshima

The independent domination number $i (G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$ , also called an $i (G)$ -set. The $i$ -graph of $G$ , denoted $\m…

math.CO2017★ 1 cited

Connected k-Dominating Graphs

C. M. Mynhardt, R. Roux, L. E. Teshima

For a graph G=(V,E), the k-dominating graph of G, denoted by $D_{k} (G)$ , has vertices corresponding to the dominating sets of G having cardinality at most k, where two vertices of…

math.CO2017★ 2 cited

A note on some variations of the $γ$ -graph

C. M. Mynhardt, L. E. Teshima

For a graph $G$ , the $γ$ -graph of $G$ , $G (γ)$ , is the graph whose vertices correspond to the minimum dominating sets of $G$ , and where two vertices of $G (γ)$ are adjacent if and on…

math.CO2014

Multipackings in Graphs

L. E. Teshima

A vertex subset M of a graph G is a multipacking if for each vertex v, and each positive integer s less than or equal to the diameter of G, v is within distance s of at most s vert…