Bondy J.A., Murty U.S.R. — Graph theory with applications :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Bondy J.A., Murty U.S.R. — Graph theory with applications

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Graph theory with applications

Авторы: Bondy J.A., Murty U.S.R.

Язык:

Рубрика: Математика/Алгебра/Комбинаторика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1976

Количество страниц: 264

Добавлена в каталог: 09.03.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

$\alpha$ -critical graph      103
$\beta$ -critical graph      103
$\kappa$ -critical graph      47
Acyclic graph      25
Adjacency matrix of a digraph      173
Adjacency matrixof a graph      7
Adjacent vertices, edges      3
ARC      171
Associated digraph      179
Automorphism      6
Automorphism group      7
Avoiding bridges      146
Bandwidth      248
Basis matrix      215
Basis matrix corresponding to a tree      216
Berge's theorem      80
Binding number      249
Bipartite graph      4
Bipartition      5
Block      44
Block of a graph      44
BOND      29
Bond space      213
Breakthrough      199
Bridge      146
Brooks' Theorem      122
Brouwer's fixed-point theorem      21
Cage      236
capacity function      191
Capacity of a cut      194
Capacityof an arc      191
Cayley's formula      32
Centre      27
Chinese postman problem      62
Chromatic number      117
Chromatic number of a surface      243
Chromatic polynomial      126
Chvital graph      241
Circulation      212
CLIQUE      103
Closed walk      14
Closure      56
Complement of a graph      6
Complementof a subgraph      29
Complete bipartite graph      5
Complete graph      4
Complete k-partite graph      6
Component      13
Composition of two graphs      108
Condensation      173
Conductance matrix      220
Connected graph      13
Connected vertices      13
Connectivity      42
Connector problem      36
Conservation condition      191
Contraction of an edge      32
CONVERSE      173
Cotree      29
Covering      73
Covering number      101
Coxeter graph      241
Critical graph      117
cube      234
Cut      194
Cut edge      27
Cut vertex      31
CYCLE      14
Cycle space      212
Degree of a face      140
Degree sequence      11
Degree-majorised      58
Degreeof a vertex      10
demand      206
Diameter      14
Diameter of a plane set      113
Dicomponent      172
Diconnected digraph      172
Digraph      171
Dijkstra's algorithm      19
Dirac's theorem      54
Directed cycle      172
Directed diameter      186
Directed Euler tour      179
Directed graph      171
Directed Hamilton cycle      177
Directed Hamilton Path      174
Directed path      172
Directed tour      172
Directed trail      172
Directed walk      171
Disconnected graph      13
Disjoint subgraphs      9
Distance in a digraph      186
Distance in a graph      14
Distance in a weighted graph      16
dodecahedron      234
Dual      140
Duplication of an edge      63
EDGE      1
Edge chromatic number      91
Edge connectivity      42
Edge covering      102
Edge covering number      102
Edge cut      29
Edge graph      11
Edge independence number      102
Edge-disjoint subgraphs      9
Edge-induced subgraph      9
Edge-transitive graph      7
Embeddable on a surface      136
Embedding      137
Empty graph      4
END      1
Equivalent k-bridges      146
Euler tour      51
Euler trail      51
Euler's formula      143
Euler's theorem      51
Eulerian graph      51
Even component      76
Even cycle      14
Exterior face      139
Exterior of a Jordan curve      135
Extremal graph theory      109
f-incrementing path      196
f-positive arc      195
f-saturated arc      195
f-saturated path      196
f-unsaturated arc      195
f-unsaturated path      196
f-unsaturated tree      198
f-zero arc      195
Face      139
Face chromatic number      158
Fary's theorem      139
Feasible flow      206
Finite graph      3
Five-colour Theorem      156
Fleury's algorithm      62
Flow      191
Folkman graph      235
Forcibly hamiltonian sequence      248
Forest      26
Four-colour Conjecture      157
Four-colour problem      158
Franklin graph      244
Frucht's Theorem      7
Generalised Ramsey numbers      109
girth      15

Good algorithm      19
Graceful graph      248
Graph      1
Graphic sequence      11
Gray graph      235
Greenwood — Gleason graph      242
Grinberg graph      162
Groetzsch graph      118
Groetzsch's theorem      159
Grunbaum graph      242
Hadwiger's conjecture      124
Hajos' conjecture      123
Hall's theorem      72
Hamilton cycle      53
Hamilton path      53
Hamilton-connected graph      61
Hamiltonian graph      53
head      171
Heawood graph      236
Herschel graph      53
Hoffman-Singleton graph      239
Horton graph      240
Hungarian method      82
Hypohamiltonian graph      61
Hypotraceable graph      61
icosahedron      234
Identical graphs      4
Improvement of an edge colouring      92
In-neighbour      175
Incidence function of a digraph      171
Incidence function of a graph      1
Incidence matrix of a digraph      214
Incidence matrix of a graph      7
Incident, edge with vertex      3
Incident, face with edge or vertex      140
Indegree      172
Independence number      101
Independent set      101
Induced subgraph      9
Inner bridge      148
Interior of a Jordan curve      135
Intermediate vertices      191
Internal vertices      12
Internally-disjoint paths      44
Intersection of graphs      10
Isomorphic graphs      4
Isomorphism      4
Join of two graphs      58
Joined vertices in a digraph      171
Joined vertices in a graph      1
Jordan curve      135
Jordan curve theorem      135
k-arc-connected digraph      179
k-bridge      146
k-chromatic graph      117
k-colourable graph      117
k-colouring      117
K-connected graph      42
k-critical graph      117
k-cube      6
K-cycle      14
k-edge colouring      91
k-edge cut      42
k-edge-chromatic graph      91
k-edge-colourable graph      91
k-edge-connected graph      42
k-face colouring      158
k-face-colourable plane graph      158
k-factor      71
k-factorable graph      71
k-partite graph      6
k-regular graph      11
k-vertex colouring      117
k-vertex cut      42
k-vertex-colourable graph      117
Kirchhoff's current law      223
Koenig's Theorem      74
Kruskal's algorithm      37
Kuhn — Munkres algorithm      87
Kuratowski's theorem      153
Labelling method      198
Labelling procedure      198
Length of walk      12
Link      3
Loop      3
M-alternating path      70
M-alternating tree      81
M-augmenting path      70
M-saturated vertex      70
M-unsaturated vertex      70
Map colour theorem      244
Marriage theorem      73
Matching      70
Matrix-tree theorem      219
Max-flow min-cut theorem      198
Maximum flow      192
Maximum independent set      101
Maximum matching      70
McGee graph      237
Menger's theorems      46
Meredith graph      239
Minimum covering      73
Minimum cut      195
Multiplicity      95
Neighbour set      72
Network      191
Nontrivial graph      3
octahedron      234
Odd component      76
Odd cycle      14
Optimal assignment problem      86
Optimal cycle      65
Optimal k-edge colouring      92
Optimal matching      86
Optimal tour      62
Optimal tree      36
Order of a squared rectangle      220
Order of magnitude of a function      19
Orientation      171
Origin of a walk      12
Out-neighbour      175
Outdegree      172
Outer bridge      148
Overlapping bridges      146
Path      12
Perfect graph      250
Perfect matching      70
Perfect rectangle      220
Personnel assignment problem      80
Petersen graph      55
Petersen's theorem      79
Planar embedding      135
Planar graph      135
Plane graph      135
Plane triangulation      143
Platonic graphs      234
Potential difference      212
Potentially planar sequence      251
Probabilistic method      107
Product of graphs      96
Proper colouring      117
Proper edge colouring      91
Proper face colouring      158
Proper subgraph      8
Ramsey graphs      106
Ramsey numbers      104
Ramsey's theorem      103
Reachable vertex      172
Reconstruction Conjecture      246
Redei's theorem      175

1 2

О проекте