Erfang Shan

Matching and domination numbers in r-uniform hypergraphs

A matching is a set of pairwise disjoint hyperedges of a hypergraph H. The matching number

Constructing the minimum dominating sets of generalized de Bruijn digraphs

\nu (H)

Two efficient values of cooperative games with graph structure based on \tau -values

ν(H) of H is the maximum cardinality of a matching. A subset D of vertices of H is called a dominating set of H if for every vertex v not in D there exists

3-Factor-Criticality in Double Domination Edge Critical Graphs

u\in D

The Position Value and the Myerson Value for Hypergraph Communication Situations

u∈D such that u and v are contained in a hyperedge of H. The minimum cardinality of a dominating set of H is called the domination number of H and is denoted by