Advertisement

Walks in Graphs

Chapter
  • 5.8k Downloads
Part of the Undergraduate Texts in Mathematics book series (UTM)

Abstract

Given a finite set S and integer k≥0, let \(\binom{S}{k}\) denote the set of k-element subsets of S. A multiset may be regarded, somewhat informally, as a set with repeated elements, such as {1,1,3,4,4,4,6,}. We are only concerned with how many times each element occurs and not on any ordering of the elements. Thus for instance {2,1,2,4,1,2} and {1,1,2,2,2,4} are the same multiset: they each contain two 1’s, three 2’s, and one 4 (and no other elements).

Keywords

Main Diagonal Entries Ordinary Matrix Multiplication Complete Graph K4 Incident Edges Real Symmetric Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 13.
    A.E. Brouwer, W.H. Haemers, Spectra of Graphs (Springer, New York, 2012)Google Scholar
  2. 22.
    D.M. Cvetković, M. Doob, H. Sachs, Spectra of Graphs: Theory and Applications, 3rd edn. (Johann Ambrosius Barth, Heidelberg/Leipzig, 1995)Google Scholar
  3. 23.
    D.M. Cvetković, P. Rowlinson, S. Simić, in An Introduction to the Theory of Graph Spectra. London Mathematical Society. Student Texts, vol. 75 (Cambridge University Press, Cambridge, 2010)Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of MathematicsMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations