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 条
  • [1] On Computing the Path Number of a Graph
    Botler, F.
    Cano, R.
    Sambinelli, M.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 185 - 197
  • [2] COMPUTING THE ISOPERIMETRIC NUMBER OF A GRAPH
    GOLOVACH, PA
    CYBERNETICS AND SYSTEMS ANALYSIS, 1994, 30 (03) : 453 - 457
  • [3] The Binding Number of a Graph
    Taian
    数学研究与评论, 1991, (02) : 297 - 298
  • [4] On pitfalls in computing the geodetic number of a graph
    Hansen, Pierre
    van Omme, Nikolaj
    OPTIMIZATION LETTERS, 2007, 1 (03) : 299 - 307
  • [5] On pitfalls in computing the geodetic number of a graph
    Pierre Hansen
    Nikolaj van Omme
    Optimization Letters, 2007, 1 : 299 - 307
  • [6] A Binding Number Computation of Graph
    Han, Congying
    He, Guoping
    Duan, Hua
    Zhang, Xuping
    FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 4, PROCEEDINGS, 2008, : 285 - +
  • [7] BINDING NUMBER OF A GRAPH AND ITS TRIANGLE
    施容华
    Science Bulletin, 1986, (02) : 138 - 139
  • [8] Binding number for coprime graph of groups
    Mallika, A.
    Ansari, J. Ahamed Thamimul
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2023, 20 (01) : 40 - 46
  • [9] The binding number of a graph and its cliques
    Lyle, Jeremy
    Goddard, Wayne
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (15) : 3336 - 3340
  • [10] THE BINDING NUMBER OF A GRAPH AND ITS PANCYCLISM
    施容华
    ScienceBulletin, 1986, (21) : 1507 - 1507
12345