Pak Kiu Sun

  • Citations Per Year
Learn More
Let G = (V,E) be a graph. A total restrained dominating set is a set S ⊆ V where every vertex in V \ S is adjacent to a vertex in S as well as to another vertex in V \S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by γ r (G), is the smallest cardinality of a total restrained dominating set(More)
Two inequalities are established connecting the graph invariants of incidence chromatic number, star arboricity and domination number. Using these, upper and lower bounds are deduced for the incidence chromatic number of a graph and further reductions are made to the upper bound for a planar graph. It is shown that cubic graphs with orders not divisible by(More)
  • 1