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 条

[31] Computing the Number of k-Component Spanning Forests of a Graph with Bounded Treewidth
Wan, Peng-Fei
Chen, Xin-Zhuang
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 385 - 394
[32] Computing the Number of k-Component Spanning Forests of a Graph with Bounded Treewidth
Peng-Fei Wan
Xin-Zhuang Chen
Journal of the Operations Research Society of China, 2019, 7 : 385 - 394
[33] An iteration method for computing the total number of spanning trees and its applications in graph theory
Ma, Fei
Yao, Bing
THEORETICAL COMPUTER SCIENCE, 2018, 708 : 46 - 57
[34] Binding number and fractional (g, f, n′, m)-critical deleted graph
Gao, Wei
Wang, Weifan
ARS COMBINATORIA, 2014, 113A : 49 - 64
[35] ON COMPUTING GRAPH CLOSURES
KHULLER, S
INFORMATION PROCESSING LETTERS, 1989, 31 (05) : 249 - 255
[36] Computing the Newtonian Graph
J Symb Comput, 2 (125):
[37] Computing the Newtonian graph
Kozen, D
Stefansson, K
JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (02) : 125 - 136
[38] COMPUTING THE STRENGTH OF A GRAPH
GUSFIELD, D
SIAM JOURNAL ON COMPUTING, 1991, 20 (04) : 639 - 654
[39] On the detour number and geodetic number of a graph
Chartrand, G
Johns, GL
Zhang, P
ARS COMBINATORIA, 2004, 72 : 3 - 15
[40] Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph
Berry, Anne
Simonet, Genevieve
ALGORITHMS, 2021, 14 (12)

← 1 2 3 4 5 →