Contents

  1. Books

Academic literature on the topic 'Trees (Graph theory) Eigenvalues'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Trees (Graph theory) Eigenvalues.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Books on the topic "Trees (Graph theory) Eigenvalues"

1

Spectral graph theory. Published for the Conference Board of the mathematical sciences by the American Mathematical Society, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Peter, Rowlinson, and Simić S, eds. Spectral generalizations of line graphs: On graphs with least negative eigenvalue -2. Cambridge University Press, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Limnios, N. Fault trees. ISTE, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kasʹi͡anov, V. N. Graph theory for programmers: Algorithms for processing trees. Kluwer Academic, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

A, Evstigneev V., ed. Graph theory for programmers: Algorithms for processing trees. Kluwer Academic, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Introduction to [lambda]-trees. World Scientific, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Crouch, Peter. Trees, bialgebras and intrinsic numerical algorithms. Dept. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rubin, Matatyahu. The reconstruction of trees from their automorphism groups. American Mathematical Society, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Leister, Karen J. Using minimal spanning trees to compare the reliability of network topologies. Langley Research Center, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Scheffler, Petra. Linear-time algorithms for NP-complete problems restricted to partial k-trees. Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!