T. Kalinowski

activity

20122023

most citedA Social Welfare Optimal Sequential Allocation Procedure

44 citations · 263 across the 29 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

cs.DM2016★ 4 cited

On the power domination number of de Bruijn and Kautz digraphs

Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1

Let $G = (V, A)$ be a directed graph without parallel arcs, and let $S \subseteq V$ be a set of vertices. Let the sequence $S = S_{0} \subseteq S_{1} \subseteq S_{2} \subseteq \dots$ be defined a…

math.CO2016★ 36 cited

A lower bound on the zero forcing number

Randy Davila, Thomas Kalinowski, Sudeep Stephen

In this note, we study a dynamic vertex coloring for a graph $G$ . In particular, one starts with a certain set of vertices black, and all other vertices white. Then, at each time s…

cs.DM2016★ 1 cited

$H$ -supermagic labelings for firecrackers, banana trees and flowers

Rachel Wulan Nirmalasari Wijaya, Andrea Semaničová-Feňovčíková, Joe Ryan +1

A simple graph $G = (V, E)$ admits an $H$ -covering if every edge in $E$ is contained in a subgraph $H^{'} = (V^{'}, E^{'})$ of $G$ which is isomorphic to $H$ . In this case we say that $G$ is $H$ -…

math.CO2016★ 6 cited

Minimum rank and zero forcing number for butterfly networks

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2

The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$ . Using t…

On the power domination number of de Bruijn and Kautz digraphs

A lower bound on the zero forcing number

H-supermagic labelings for firecrackers, banana trees and flowers

Minimum rank and zero forcing number for butterfly networks

$H$ -supermagic labelings for firecrackers, banana trees and flowers