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

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

blank
blank
blank
Красота
blank
Liu B., Lai H.-J. — Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3)
Liu B., Lai H.-J. — Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3)



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



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


Название: Matrices in Combinatorics and Graph Theory (Network Theory and Applications Volume 3)

Авторы: Liu B., Lai H.-J.

Аннотация:

The first chapter of this book provides a brief treatment of the basics of the subject. The other chapters deal with the various decompositions of non-negative matrices, Birkhoff type theorems, the study of the powers of non-negative matrices, applications of matrix methods to other combinatorial problems, and applications of combinatorial methods to matrix problems and linear algebra problems. The coverage of prerequisites has been kept to a minimum. Nevertheless, the book is basically self-contained (an Appendix provides the necessary background in linear algebra, graph theory and combinatorics). There are many exercises, all of which are accompanied by sketched solutions. Audience: The book is suitable for a graduate course as well as being an excellent reference and a valuable resource for mathematicians working in the area of combinatorial matrix theory.


Язык: en

Рубрика: Математика/

Серия: Сделано в холле

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

ed2k: ed2k stats

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Minimum polynomial      275
Moore graph      5
Multi-colored      172
Multiple arcs      280
Multiple edges      279
n-derangement      91
Nearly decomposable      58
Nonnegative completion      250
Nonnegative matrix      275
Nonnegative-completable      250
Nonseparable      197
Normal form, equivalence      52
Normal form, Frobenius      50
Normalized class      75
Optimal representation      182
Ordering      251
Orientation      280
Oriented incidence matrix      2
Orthonormal representation      181
Orthonormal representation, value      181
Out-incidence matrix      19
Outdegree      280
Partial Hermitian      249
Partial scheme      246
Partial transversal      167
Particular solution      162
Partly decomposable      48
partners      248
Path      279
Path matrix      177
Path, (x,y)-path      279
Perfect      246
Perfect edge elimination scheme      246
Perfect elimination bipartite graph      246
Perfect elimination scheme      245
Perfect graph      181
Perfect scheme      246
Perfect vertex elimination scheme      246
Period of convergence      102
Permanent      61
Permutation      236
Permutation equivalent      1
Permutation matrix      1
Permutation similar      1
Polynomial, characteristic      275
Polynomial, minimum      275
Positive completion      250
Positive matrix      275
Positive semidefinite completion      249
Pre-order      258
primitive      102
Primitive digraph      107
Primitive exponent      107
Problem, Extremal Matrix      111
Problem, Frobenius      99
Problem, Maximum Index      111
Problem, Set of Indices      111
Problem, Set of Matrices      112
Procedure Redirecting      51
Product, Kronecker      24
Product, strong      181
Product, tensor      24 181
Proper vertex k-coloring      204
r-regular      30
Reach      107
Rearrangement      236
Rearrangement, trivial      236
Recurrence relation      161
Reduced adjacency matrix      2
Reduced associated bipartite graph      2
Reduced graph      262
Reducible      48
Reducible, nearly      54
Representation, bipartite digraph      224
Representation, optimal      182
Representation, orthonormal      181
Root      22
Rooted forest      266
Rooted graph      22
Row sum vector      71
SBIBD      169
Scheme, partial      246
Scheme, perfect      246
Scheme, perfect edge elimination      246
Scheme, perfect elimination      245
Scheme, perfect vertex elimination      246
SCR      168
SDR      167
Segre characteristic      265
Semi-definite positive      41
Semidefinite Hermitian      249
Separable      197
Set of Indices problem      111
Set of Matrices problem      112
Shannon capacity      181
SIMPLE      197 279
Simplicial vertex      246
Single arc      228
Singular graph      266
Singular vertex      262
Solution, homogenous      162
Solution, particular      162
Source component      90
spanning      197
Spanning subgraph      279
Spectral radius      12 24
Spectrum      4
Square bipartite digraph      238
SR      167
Steiner      169
Stochastic matrix      77
Strict diagonal dominant      254
Strict fully indecomposable exponent      137
Strict Hall exponent      142
Strictly positive      275
Strong component      281
Strong product      181
Strongly regular graph      190
Subeulerian      198
Subgraph      279
SubMatrix      47
Sum vector, column      71
Sum vector, row      71
Supercompact      84
Supereulerian      198
Supergraph      279
Symmetric balanced incomplete block design      169
System of common representatives      168
System of distinct representatives      167
System of representatives      167
t-design      168
tail      280
Tensor product      24 181
Term rank      277
Topological ordering      90
Total graph      17
Total support      53
Totally unimodular      3
Trace      276
Trail      279
Trail, (x,y)-trail      279
Trail, closed      279
Transversal, partial      167
Tree, v-sink      179
Tree, v-source      179
Trivial block      143
Trivial rearrangement      236
union      280
Union, disjoint      280
Upper entry      241
v-sink tree      179
v-source tree      179
Vector, nonnegative      275
Vector, positive      275
Vertex      279
Vertex cover      167
Vertex, distinguished      266
Vertex, simplicial      246
Vertex, singular      262
Walk      279
Weak fully indecomposable exponent      145
Weak Hall exponent      145
Weak primitive exponent      145
Weakly irreducible      257
Weight function      62
Weighted associate digraph      163
Weighted bipartite graph      217
Weighted digraph      217
Whole chain      73
Wyre characteristic      265
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте