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 条
  • [21] An SDP-based approach for computing the stability number of a graph
    Gaar, Elisabeth
    Siebenhofer, Melanie
    Wiegele, Angelika
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2022, 95 (01) : 141 - 161
  • [22] A Graph-Theory-Based Algorithm for Euler Number Computing
    He, Lifeng
    Yao, Bin
    Zhao, Xiao
    Yang, Yun
    Chao, Yuyan
    Ohta, Atsushi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2015, E98D (02): : 457 - 461
  • [23] Computing the stability number of a graph via linear and semidefinite programming
    Pena, Javier
    Vera, Juan
    Zuluaga, Luis F.
    SIAM JOURNAL ON OPTIMIZATION, 2007, 18 (01) : 87 - 105
  • [24] An SDP-based approach for computing the stability number of a graph
    Elisabeth Gaar
    Melanie Siebenhofer
    Angelika Wiegele
    Mathematical Methods of Operations Research, 2022, 95 : 141 - 161
  • [25] THE NUMBER OF BINDING-SITES - THE KLOTZ GRAPH ANALYZED
    BESTBELPOMME, M
    ERDOS, T
    ACTA BIOCHIMICA ET BIOPHYSICA HUNGARICA, 1987, 22 (2-3) : 181 - 193
  • [26] Toughness, binding number and restricted matching extension in a graph
    Plummer, Michael D.
    Saito, Akira
    DISCRETE MATHEMATICS, 2017, 340 (11) : 2665 - 2672
  • [27] The complexity of computing the cylindrical and the t-circle crossing number of a graph
    Duque, Frank
    Gonzalez-Aguilar, Hernan
    Hernadez-Velez, Cesar
    Leanos, Jesus
    Medina, Carolina
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
  • [28] Computing the chromatic number using graph decompositions via matrix rank
    Jansen, Bart M. P.
    Nederlof, Jesper
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 520 - 539
  • [29] Computing the anti-Ramsey number for trees in complete tripartite graph
    Jin, Zemin
    Wang, Yite
    Ma, Huawei
    Wang, Huaping
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 456
  • [30] Computing the P3-hull number of a graph, a polyhedral approach
    Blaum, Manuela
    Marenco, Javier
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 155 - 166
12345