Авторизация
Поиск по указателям
Harary F. — Graph Theory
Обсудите книгу на научном форуме Нашли опечатку?
Название: Graph TheoryАвтор: Harary F. Аннотация: There are several reasons for the acceleration of interest in graph theory. It has become fashionable to mention that there are applications of graph theory to some areas of physics, chemistry, communication science, computer technology, electrical and civil engineering, architecture, operational research, genetics, psychology, sociology, economics, anthropology, and linguistics. The theory is also intimately related to many branches of mathematics, including group theory, matrix theory, numerical analysis, probability, topology, and combinatorics. The fact is that graph theory serves as a mathematical model for any system involving a binary relation. Partly because of their diagrammatic representation, graphs have an intuitive and aesthetic appeal. Although there are many results in this field of an elementary nature, there is also an abundance of problems with enough combinatorial subtlety to challenge the most sophisticated mathematician.
Язык: Рубрика: Математика /Статус предметного указателя: Готов указатель с номерами страниц ed2k: ed2k stats Год издания: 1969Количество страниц: 274Добавлена в каталог: 20.11.2009Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Matrix, reachability 203 Matroid 40 157 Matroid, binary 159 Matroid, cocycle 40 Matroid, cographical 157 Matroid, cycle 40 Matroid, eulerian 159 Matroid, graphical 157 Multigraph 10 n-cage 174 n-chromatic graph 127 n-chromatic number 149 n-colorable graph 127 n-colorable graph, map 131 n-coloring 126 N-component 46 n-connected graph 45 n-critical graph (color) 141 n-cube 23 n-factor 84 n-factorable graph 84 n-factorization 84 n-line coloring 133 n-line connected graph 45 n-line critical graph (color) 142 n-regular graph 174 n-route 173 n-transitive graph 173 n-unitransitive graph 174 Neighborhood 167 Neighborhood, closed 167 Network 52 Nonseparable graph 26 Orbit 180 Order of a permutation group 161 Orientation 210 Oriented graph 10 Out-tree 201 Outdegree 198 Outerplanar graph 106 Outerplanar graph, maximal 106 Pair group 185 Pair group, reduced ordered 186 Partition of a graph 57 Partition of a non-negative integer 57 Partition, graphical 57 Partition, simple 61 Path, in a digraph 198 Path, in a graph 13 Paving of a 2-lattice 194 Peripheral point 41 Permutation 161 Permutation, graph 175 Permutation, group 161 Petersen graph 89 Place 181 Planar graph 102 Planar graph, maximal 104 Plane graph 102 Planted tree 188 Point, central 35 Point, centroid 36 Point, cover 94 Point, covering number 94 Point, critical (cover) 98 Point, end- 15 Point, fixed 171 Point, independence number 95 Point, isolated 15 Point, of a digraph 198 Point, of a graph 9 Point, peripheral 41 Point, removal of 11 Point, weight at 35 Polyhedron, convex 106 Power group 164 Primative digraph 210 Prime graph 166 Product, of graphs 21 Product, of permutation groups 163 Pseudograph 10 RADIUS 35 Ramsey number 16 Ramsey number, line form 82 Reachability 199 Reachability, matrix 203 Reducible graph 99 Regular graph 14 Removal, of a line 11 Removal, of a point 11 Rooted tree 187 Score 207 Self-complementary graph 15 Semi walk 199 Semi-irreducible graph 99 Semicycle 199 Semigroup of a graph 177 Semipath 199 Separates 47 Similar lines 171 Similar points 171 Sink 201 Source 201 Spanning subgraph 11 Square of a graph 14 Square root of a graph 24 Stabilizer 180 Star 17 Strong component 199 Strong digraph 199 Subdivision graph 81 Subgraph 11 Subgraph, even 194 Subgraph, induced 11 Subgraph, linear 151 Subgraph, spanning 11 Successor walk 173 Sum, of factors 84 Sum, of permutation groups 163 Supergraph 11 Symmetric graph 171 Symmetry line 189 Theta graph 66 Thickness 120 Toroidal graph 117 Total graph 82 Totally disconnected graph 16 Tournament 205 Trail 13 Trail, eulerian 64 204 Transitive triple 205 TREE 32 Tree, block-cutpoint 37 Tree, planted 188 Tree, rooted 187 triangle 13 Trivial digraph 199 Trivial graph 9 Twig 39 Unicyclic graph 41 Unilateral component 199 Unilateral digraph 199 Unilaterally connected 199 union 21 Uniquely colorable graph 137 Walk, closed, in a digraph 198 Walk, closed, in a graph 13 Walk, in a digraph 198 Walk, in a graph 13 Walk, open 13 Walk, spanning 198 Weak component 199 Weak digraph 199 Weakly connected 199 Weight at a point 35 Weight function 180 Wheel 46 Whirl 158
Реклама
|
|
О проекте