Weighted Competition Graphs
Yoshio Sano · 2007
We introduce a generalization of competition graphs, called weighted competition graphs. The weighted competition graph of a digraph D = (V, A), denoted by Cw(D), is an edge-weighted graph (G, w) such that G = (V, E) is the competition graph of D, and the weight w(e) of an edge e = xy ∈ E is the number of the common preys of x and y in D. We investigate properties of weighted competition graphs.