Cantitate/Preț
Produs
Total produse
Vezi coșul
Threshold Graphs and Related Topics de N.V.R. Mahadev

Threshold Graphs and Related Topics: Annals of Discrete Mathematics, cartea 56

Autor N.V.R. Mahadev, U.N. Peled
en Limba Engleză Hardback – 12 sep 1995
Threshold graphs have a beautiful structure and possess many important mathematical properties. They have applications in many areas including computer science and psychology. Over the last 20 years the interest in threshold graphs has increased significantly, and the subject continues to attract much attention. The book contains many open problems and research ideas which will appeal to graduate students and researchers interested in graph theory. But above all Threshold Graphs and Related Topics provides a valuable source of information for all those working in this field.
Citește tot Restrânge

Din seria Annals of Discrete Mathematics

Preț: 84395 lei

Preț vechi: 105494 lei
-20% Nou

Puncte Express: 1266
Preț estimativ în valută:
16151€ • 16777$ • 13416£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780444892874
ISBN-10: 0444892877
Pagini: 542
Ilustrații: graphs, bibliography, indexes
Dimensiuni: 156 x 234 x 32 mm
Greutate: 0.96 kg
Editura: ELSEVIER SCIENCE
Seria Annals of Discrete Mathematics

Cuprins

Preface. Basic Terminology. Threshold Graphs. Motivation. Basic characterizations. Minimizing integral weights. Perfect graphs and algorithms. Threshold and split completions. Longest cycles and Hamiltonicity. Total coverings and total matchings. Ferrers Digraphs and Difference Graphs. Introduction. Ferrers digraphs, characterizations. The Ferrers dimension. Difference graphs. Degree Sequences. Graphical degree sequences. Threshold sequences. The polytope of degree sequences. Difference sequences. Applications.Introduction. Aggregation of inequalities. Synchronization. Cyclic scheduling. Guttman scales. Split Graphs. Introduction. Basic properties. Hamiltonian split graphs. The splittance of a graph. The Threshold Dimension. Introduction. Bounds for the threshold dimension. Dimensional properties. Operations preserving the threshold dimension. Restricted threshold dimension. NP-Completeness. Introduction. The partial order dimension. Related NP-complete problems. Other complexity results. The split dimension. Polar graphs. 2-Threshold Graphs. Introduction. Properties of 2-threshold graphs. Bithreshold graphs. Strict 2-threshold graphs. Recognizing threshold dimension 2. Recognizing difference dimension 2. Intersection threshold dimension 2. The Dilworth Number. Introduction. Graphs of Dilworth number 2. The Dilworth number and perfect graphs. Box-Threshold Graphs. Introduction. Elementary properties. A transportation model. Frames of BT graphs. Matroidal and Matrogenic Graphs. Introduction. Matroidal graphs. Matrogenic graphs. Matrogenic sequences. Domishold Graphs. Introduction. Notation and main results. Equidominating graphs. Pseudodomishold graphs. The Decomposition Method. Introduction. The canonical decomposition. Domishold graphs and decomposition. Box-threshold graphs and decomposition. Matroidal and matrogenic graphs and decomposition. Pseudothreshold and Equistable Graphs. Introduction. Pseudothreshold graphs. Equistable graphs. Threshold Weights and Measures.Introduction. Threshold weights. Threshold measures. Threshold and majorization gaps. Threshold Graphs and Order Relations. Introduction. Biorders. Bidimensions. Relations of bidimension 2. Multiple semiorders. Enumeration. Introduction. Enumeration of threshold graphs. Enumeration of difference graphs. Extremal Problems. Introduction. Large interval and threshold subgraphs of dense graphs. Maximizing the sum of squares of degrees. Other Extensions. Introduction. Geometric embeddings of graphs. Tolerance intersection graphs. Universal threshold graphs. Bibliography. List of Notations. Author Index. Index.