Competition hypergraphs

被引：43

作者：

Sonntag, M

Teichert, HM

机构：

[1] Med Univ Lubeck, Inst Math, D-23560 Lubeck, Germany

[2] Freiberg Univ Min & Technol, Fac Math & Comp Sci, D-09596 Freiberg, Germany

来源：

DISCRETE APPLIED MATHEMATICS | 2004年 / 143卷 / 1-3期

关键词：

hypergraph; competition graph; food web;

D O I：

10.1016/j.dam.2004.02.010

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

If D = (V,A) is a digraph, its competition hypergraph CH(D) has vertex set V and e subset of or equal to V is an edge of CH(D) iff \e\greater than or equal to2 and there is a vertex vis an element ofV, such that e=N-(v)={wis an element ofV\(w,v)is an element ofA}. Besides a motivation for this new concept, closely related to the well-known competition graphs, we present several properties of competition hypergraphs and discuss connections to corresponding results for competition graphs. (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：324 / 329

页数：6

共 12 条

[1]

Bang-Jensen J., 2001, DIGRAPHS THEORY ALGO

[2]

COHEN JE, 1968, 17696PR

[3] A CHARACTERIZATION OF COMPETITION GRAPHS [J].

DUTTON, RD ;

BRIGHAM, RC .

DISCRETE APPLIED MATHEMATICS, 1983, 6 (03) :315-317

[4] INVERTING GRAPHS OF RECTANGULAR MATRICES [J].

GREENBERG, HJ ;

LUNDGREN, JR ;

MAYBEE, JS .

DISCRETE APPLIED MATHEMATICS, 1984, 8 (03) :255-265

[5]

Kim Suh-Ryung, 1993, Ann. Discrete Math., V55, P313, DOI DOI 10.1016/S0167-5060(08)70396-0

[6]

LUNDGREN JR, 1989, IMA V MATH, V17, P221

[7] A CHARACTERIZATION OF GRAPHS OF COMPETITION NUMBER-M [J].

LUNDGREN, JR ;

MAYBEE, JS .

DISCRETE APPLIED MATHEMATICS, 1983, 6 (03) :319-322

[8] ON THE COMPUTATION OF THE COMPETITION NUMBER OF A GRAPH [J].

OPSUT, RJ .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (04) :420-428

[9]

Roberts F. S., 1978, Theory and applications of graphs, P477

[10] A CHARACTERIZATION OF COMPETITION GRAPHS OF ARBITRARY DIGRAPHS [J].

ROBERTS, FS ;

STEIF, JE .

DISCRETE APPLIED MATHEMATICS, 1983, 6 (03) :323-326

← 1 2 →