Fiona Knoll

activity

20152024

most citedOptimal Bounds for Johnson-Lindenstrauss Transformations

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2016★ 3 cited

Split Domination, Independence, and Irredundance in Graphs

Stephen Hedetniemi, Fiona Knoll, Renu Laskar

In 1978, Kulli and Janakiram \citep{KulliJanakiramSplit} defined the split dominating set: a dominating set $S$ of vertices in a graph $G = (V, E)$ is called {\em split dominating}…

math.CO2015

Cycle Domination, Independence and Irredundance in graphs

Amy Grady, Fiona Knoll, Renu Laskar +1

A set $S$ of vertices in a graph $G = (V, E)$ is called {\em cycle independent} if the induced subgraph $⟨ S ⟩$ is acyclic, and called {\em odd-cycle indepdendet} if $\l…