Competition Numbers of a Kind of Pseudo-Halin Graphs


For any graph G , G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number ( ) k G of a graph G is defined to be the smallest number of such isolated vertices. In general, it is hard to compute the competition number ( ) k G for a graph G and characterizing a graph by its competition number… (More)


2 Figures and Tables

Slides referencing similar topics