K. Wash

activity

20122017

most citedSpectral properties of the hierarchical product of graphs

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

collaborators

Showing 2016 · math.COShow all

3 papers · 2 filters

math.CO2016★ 1 cited

Packing chromatic number under local changes in a graph

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$ -vertex coloring of $G$ in which any two vertices receiving color $i$ a…

math.CO2016★ 3 cited

Packing chromatic number, $(1, 1, 2, 2)$ -colorings, and characterizing the Petersen graph

Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $Π_{1}, \dots, Π_{k}$ , where $Π_{i}$ , $i\in […

math.CO2016

On minimum identifying codes in some Cartesian product graphs

Douglas F. Rall, Kirsti Wash

An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The…

Packing chromatic number under local changes in a graph

Packing chromatic number, (1,1,2,2)-colorings, and characterizing the Petersen graph

On minimum identifying codes in some Cartesian product graphs

Packing chromatic number, $(1, 1, 2, 2)$ -colorings, and characterizing the Petersen graph