Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

A lower bound for the packing chromatic number of the Cartesian product of cycles

Yolandé Jacobs;  Elizabeth Jonck;  Ernst Joubert — 2013

Open Mathematics

Let G = (V, E) be a simple graph of order n and i be an integer with i ≥ 1. The set X i ⊆ V(G) is called an i-packing if each two distinct vertices in X i are more than i apart. A packing colouring of G is a partition X = {X 1, X 2, …, X k} of V(G) such that each colour class X i is an i-packing. The minimum order k of a packing colouring is called the packing chromatic number of G, denoted by χρ(G). In this paper we show, using a theoretical proof, that if q = 4t, for some integer t ≥ 3, then 9...

Restrained domination in unicyclic graphs

Johannes H. Hattingh;  Ernst J. Joubert;  Marc Loizeaux;  Andrew R. Plummer;  Lucas van der Merwe — 2009

Discussiones Mathematicae Graph Theory

Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and to a vertex in V-S. The restrained domination number of G, denoted by γ r ( G ) , is the minimum cardinality of a restrained dominating set of G. A unicyclic graph is a connected graph that contains precisely one cycle. We show that if U is a unicyclic graph of order n, then γ r ( U ) ≥ ⎡ n / 3 ⎤ , and provide a characterization of graphs achieving this bound.

Page 1

Download Results (CSV)