000 | nam a22 7a 4500 | ||
---|---|---|---|
999 |
_c29092 _d29092 |
||
008 | 180809b xxu||||| |||| 00| 0 eng d | ||
020 | _a9781848216167 | ||
082 |
_a511.5 _bRIG |
||
100 | _aRigo, Michel | ||
245 | _aAdvanced graph theory and combinatorics | ||
260 |
_bJohn Wiley and Sons, _c2016 _aNew Jersey: |
||
300 |
_axiv, 268 p. : _bill.; _c24 cm. |
||
365 |
_aUS$ _b50.00 |
||
440 | _aComputer Engineering Series | ||
520 | _aAdvanced Graph Theory focuses on some of the main notions arising in graph theory with an emphasis from the very start of the book on the possible applications of the theory and the fruitful links existing with linear algebra. The second part of the book covers basic material related to linear recurrence relations with application to counting and the asymptotic estimate of the rate of growth of a sequence satisfying a recurrence relation. | ||
650 | _aGraph theory | ||
650 | _aCombinatorial analysis | ||
650 | _aSystems Architecture | ||
650 | _aUnoriented graphs | ||
650 | _aConnected components | ||
650 | _aFive-color theorem | ||
650 | _aPerron's theorem | ||
650 | _aIrreducible graphs | ||
650 | _aGoogle matrix | ||
650 | _aPerron-Frobenius theorem | ||
650 | _aComplexity Theory | ||
650 | _aTheorem of Hoffman | ||
650 | _aFrobenius Theory | ||
650 | _aPerron | ||
650 | _aChromatic number | ||
650 | _aAlgebraic Graph Theory | ||
650 | _aAdjacency matrix | ||
650 | _aChromatic polynomial | ||
650 | _aRamsey numbers | ||
650 | _aIsomorphisms | ||
650 | _aHomomorphisms | ||
942 |
_2ddc _cBK |