DOMINATING SETS AND DOMATIC NUMBER OF CIRCULAR ARC GRAPHS

被引：37

作者：

BONUCCELLI, MA

机构：

来源：

关键词：

D O I：

10.1016/0166-218X(85)90025-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：203 / 213

页数：11

共 28 条

[1] DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF A GRAPH [J].

ALLAN, RB ;

LASKAR, R .

[2]

[Anonymous], 1976, DISCRETE MATH MODELS

[3]

Bellman R., 1958, Q APPL MATH, V16, P87

[4] ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE [J].

BENZER, S .

[5]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

BOLLOBAS, B ;

COCKAYNE, EJ .

[7] MINIMUM NODE DISJOINT PATH COVERING FOR CIRCULAR-ARC GRAPHS [J].

BONUCCELLI, MA ;

BOVET, DP .

[8] DOMINATING SETS IN CHORDAL GRAPHS [J].

BOOTH, KS ;

JOHNSON, JH .

[9]

Cockayne E., 1975, Information Processing Letters, V4, P41, DOI 10.1016/0020-0190(75)90011-3

[10]

Cockayne E. J., 1977, Networks, V7, P247, DOI 10.1002/net.3230070305