Scribd Logo
Upload

Welcome to Scribd!

  • 82 views

    MTH202

    Uploaded by

    Yogesh Gandhi
    Linear algebra and graph theory are related because matrices can be used to represent graphs. The adjacency matrix of a graph G with n vertices v1, ..., vn is an n×n matrix A where the entry aij is 1 if there is an edge from vi to vj and 0 otherwise. Powers of the adjacency matrix can then be used to find the number of walks between vertices: the (i,j) entry of Ar represents the number of r-walks from vi to vj. For example, the powers of the adjacency matrix of a graph representing a delivery company's route map show the number of different connections between cities after 1, 2, or 3 steps.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    MTH202

    Uploaded by

    Yogesh Gandhi
    82 views4 pages
    Linear algebra and graph theory are related because matrices can be used to represent graphs. The adjacency matrix of a graph G with n vertices v1, ..., vn is an n×n matrix A where the entry aij is 1 if there is an edge from vi to vj and 0 otherwise. Powers of the adjacency matrix can then be used to find the number of walks between vertices: the (i,j) entry of Ar represents the number of r-walks from vi to vj. For example, the powers of the adjacency matrix of a graph representing a delivery company's route map show the number of different connections between cities after 1, 2, or 3 steps.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Linear algebra and graph theory are related because matrices can be used to represent graphs. The adjacency matrix of a graph G with n vertices v1, ..., vn is an n×n matrix A where the entry aij is 1 if there is an edge from vi to vj and 0 otherwise. Powers of the adjacency matrix can then be used to find the number of walks between vertices: the (i,j) entry of Ar represents the number of r-walks from vi to vj. For example, the powers of the adjacency matrix of a graph representing a delivery company's route map show the number of different connections between cities after 1, 2, or 3 steps.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    82 views4 pages

    MTH202

    Uploaded by

    Yogesh Gandhi
    Linear algebra and graph theory are related because matrices can be used to represent graphs. The adjacency matrix of a graph G with n vertices v1, ..., vn is an n×n matrix A where the entry aij is 1 if there is an edge from vi to vj and 0 otherwise. Powers of the adjacency matrix can then be used to find the number of walks between vertices: the (i,j) entry of Ar represents the number of r-walks from vi to vj. For example, the powers of the adjacency matrix of a graph representing a delivery company's route map show the number of different connections between cities after 1, 2, or 3 steps.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 4

    Synopsis Of Term Paper

    MTH-202

    Sumitted to:- Sumitted by:-


    Mandeep kaur Ma’m Ravi kumar
    Roll no.-B38
    Reg.no.-10804644

    Sec.-C2802
    how is linear Algebra related to graph theory?
    As you can expect, graphs can be sometimes very complicated. So one needs to find more
    practical ways to represent them. Matrices are a very useful way of studying graphs, since they
    turn the picture into numbers, and then one can use techniques from linear algebra.

    Given a graph G with n vertices v1,…,vn, we define the adjacency matrix of G with respect to
    the enumeration v1,…,vn of the vertices as being the n×n matrix A=[aij] defined by

    For example, for the graph G1 above, the adjacency matrix (with respect to the enumeration
    of its vertices) is

    Note that for an undirected graph, like G1, the adjacency matrix is symmetric (that is it is equal to
    its transpose), but it is not necessarily the case for a digraph like G2.

    Also, note that any square Boolean matrix (two values entries: 0 and 1) with 0’s on the main
    diagonal determines a unique digraph.

    The following theorem gives one important use of powers of the adjacency matrix of a graph:

    If A is the adjacency matrix of a graph G (with vertices v1,…, vn), the (i, j)-entry of Ar represents
    the number of distinct r-walks from vertex vi to vertex vj in the graph.

    Taking the square the matrix M1 above gives


    The resulting matrix gives us the number of different paths using two edges between the vertices
    of the graph G1. For instance, there are three different 2-walks between the points P2 and P7 on
    the above graph; but there is no way to get from P1 to P5 in two steps.

    Example The following diagram represents the route map of a delivery company:

    where A, B, C, D, E are the cities served by the company. The adjacency matrix M of the above
    graph is:

    so M2 is the matrix:
    and M3 is the matrix:

    If the company is mostly interested in connections from city A to city B, one can see that the
    number of 1-step connections between A and B is 1; the number of 2-step connections is 1, but
    the number of 3-step connections between the two cities is 4. These 4 connections can be given
    explicitly:

    1. A→C→E→B

    2. A→B→D→B

    3. A→D→A→B

    4. A→C→A→B

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy