COMPUTING THE BINDING NUMBER OF A GRAPH

被引：15
|
作者：
CUNNINGHAM, WH
机构：
[1] Department of Mathematics and Statistics, Carleton University, Ottawa
来源：
DISCRETE APPLIED MATHEMATICS | 1990年 / 27卷 / 03期
关键词：
D O I：
10.1016/0166-218X(90)90072-K
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The binding number of a graph G = (V,E) is min(|N(A)|{plus 45 degree rule}|A|: Ø≠A⊆V,N(A)≠V), where N(A) is the set of neighbours of A. This invariant is shown to be computable in polynomial time. © 1990.
引用
收藏
页码：283 / 285
页数：3
相关论文
共 50 条
  • [41] The eavesdropping number of a graph
    Jeffrey L. Stuart
    Czechoslovak Mathematical Journal, 2009, 59 : 623 - 636
  • [42] ON THE SEPARATION NUMBER OF A GRAPH
    MILLER, Z
    PRITIKIN, D
    NETWORKS, 1989, 19 (06) : 651 - 666
  • [43] The Convexity Number of a Graph
    Gary Chartrand
    Curtiss E. Wall
    Ping Zhang
    Graphs and Combinatorics, 2002, 18 : 209 - 217
  • [44] On the Annihilation Number of a Graph
    Pepper, Ryan
    PROCEEDINGS OF THE 15TH AMERICAN CONFERENCE ON APPLIED MATHEMATICS AND PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL AND INFORMATION SCIENCES 2009, VOLS I AND II, 2009, : 217 - +
  • [45] THE GEODETIC NUMBER OF A GRAPH
    HARARY, F
    LOUKAKIS, E
    TSOUROS, C
    MATHEMATICAL AND COMPUTER MODELLING, 1993, 17 (11) : 89 - 95
  • [46] THE NOMATIC NUMBER OF A GRAPH
    JAYARAM, SR
    NATIONAL ACADEMY SCIENCE LETTERS-INDIA, 1987, 10 (01): : 23 - 25
  • [47] THE DISCIPLINE NUMBER OF A GRAPH
    CHVATAL, V
    COOK, W
    DISCRETE MATHEMATICS, 1990, 86 (1-3) : 191 - 198
  • [48] THE GRAPH RECONSTRUCTION NUMBER
    HARARY, F
    PLANTHOLT, M
    JOURNAL OF GRAPH THEORY, 1985, 9 (04) : 451 - 454
  • [49] THE HULL NUMBER OF A GRAPH
    EVERETT, MG
    SEIDMAN, SB
    DISCRETE MATHEMATICS, 1985, 57 (03) : 217 - 223
  • [50] On the geodetic number of a graph
    Chartrand, G
    Harary, F
    Zhang, P
    NETWORKS, 2002, 39 (01) : 1 - 6
12345