Scribd Logo
Upload

Welcome to Scribd!

  • Homework 3

    Uploaded by

    JeremyKun
    6 views1 page
    This document outlines four problems related to graph theory and linear algebra for homework due on November 4. It instructs students to collaborate but cite any sources of help. Answers should be less than one page to provide enough detail to demonstrate understanding while keeping responses concise. The four problems ask students to: 1) Express the rank of a matrix as the minimum number of rank 1 matrices needed for its decomposition; 2) Compute eigenvalues and eigenvectors of the Laplacian of the hypercube graph; 3) Derive an inequality relating the eigenvalues of the Laplacian of a regular graph to its independence number; and 4) Show that subgraph induced by positive entries of an eigenvector is connected.

    Original Description:

    Third problem set from A Theorist's Toolkit

    Copyright

    © © All Rights Reserved

    Available Formats

    PS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines four problems related to graph theory and linear algebra for homework due on November 4. It instructs students to collaborate but cite any sources of help. Answers should be less than one page to provide enough detail to demonstrate understanding while keeping responses concise. The four problems ask students to: 1) Express the rank of a matrix as the minimum number of rank 1 matrices needed for its decomposition; 2) Compute eigenvalues and eigenvectors of the Laplacian of the hypercube graph; 3) Derive an inequality relating the eigenvalues of the Laplacian of a regular graph to its independence number; and 4) Show that subgraph induced by positive entries of an eigenvector is connected.

    Copyright:

    © All Rights Reserved
    Download as PS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Homework 3

    Uploaded by

    JeremyKun
    This document outlines four problems related to graph theory and linear algebra for homework due on November 4. It instructs students to collaborate but cite any sources of help. Answers should be less than one page to provide enough detail to demonstrate understanding while keeping responses concise. The four problems ask students to: 1) Express the rank of a matrix as the minimum number of rank 1 matrices needed for its decomposition; 2) Compute eigenvalues and eigenvectors of the Laplacian of the hypercube graph; 3) Derive an inequality relating the eigenvalues of the Laplacian of a regular graph to its independence number; and 4) Show that subgraph induced by positive entries of an eigenvector is connected.

    Copyright:

    © All Rights Reserved
    Download as PS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    princeton university F02 cos 597D: a theorists toolkit

    Homework 3
    Out: October 21 Due: November 4
    You can collaborate with your classmates, but be sure to list your collaborators with your
    answer. If you get help from a published source (book, paper etc.), cite that. Also, limit
    your answers to one page or less you just need to give enough detail to convince me. If
    you suspect a problem is open, just say so and give reasons for your suspicion.
    1 Show that rank A for an n n matrix A is the least k such that A can be expressed
    as the sum of k rank 1 matrices. (This characterization of rank is often useful.)
    2 Compute all eigenvalues and eigenvectors of the Laplacian of the boolean hypercube
    on n = 2
    k
    nodes.
    3 Suppose
    1
    (= d)
    2

    n
    are the eigenvalues of the Laplacian of a connected
    d-regular graph G. Then show that (G)
    n(n
    dn
    .
    4 Let G be an n-vertex connected graph. Let
    2
    be the second largest eigenvalue of
    its adjacency matrix and x be the corresponding eigenvector. Then show that the
    subgraph induced on S = {i : x
    i
    0} is connected.
    1

    You might also like