Scribd Logo
Upload

Welcome to Scribd!

  • 674 views

    Econometric Analysis W. Greene Solutions Manual

    Uploaded by

    MuhammadAbdullah59
    This document discusses bounds on the Kirchoff index of maximally controllable graphs. The upper bound is found by constructing the graph as a clique chain, whose Kirchoff index is given by a formula. The lower bound is found by constructing the graph as the cartesian product of a path graph and complete graph, whose Kirchoff index is computed using the Laplacian spectra of the graphs. References are provided for formulas and results used.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Econometric Analysis W. Greene Solutions Manual

    Uploaded by

    MuhammadAbdullah59
    674 views3 pages
    This document discusses bounds on the Kirchoff index of maximally controllable graphs. The upper bound is found by constructing the graph as a clique chain, whose Kirchoff index is given by a formula. The lower bound is found by constructing the graph as the cartesian product of a path graph and complete graph, whose Kirchoff index is computed using the Laplacian spectra of the graphs. References are provided for formulas and results used.

    Original Description:

    Kirchoff bound

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses bounds on the Kirchoff index of maximally controllable graphs. The upper bound is found by constructing the graph as a clique chain, whose Kirchoff index is given by a formula. The lower bound is found by constructing the graph as the cartesian product of a path graph and complete graph, whose Kirchoff index is computed using the Laplacian spectra of the graphs. References are provided for formulas and results used.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    674 views3 pages

    Econometric Analysis W. Greene Solutions Manual

    Uploaded by

    MuhammadAbdullah59
    This document discusses bounds on the Kirchoff index of maximally controllable graphs. The upper bound is found by constructing the graph as a clique chain, whose Kirchoff index is given by a formula. The lower bound is found by constructing the graph as the cartesian product of a path graph and complete graph, whose Kirchoff index is computed using the Laplacian spectra of the graphs. References are provided for formulas and results used.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3
    At a glance
    Powered by AI
    The document discusses methods to calculate upper and lower bounds of the Kirchoff index for a maximally controllable graph. The upper bound is found using a clique chain supergraph, while the lower bound uses a subgraph that is the cartesian product of a path graph and complete graph. Formulas involving the Laplacian spectra are provided.

    The upper bound is calculated by constructing a supergraph of the maximally controllable graph as a clique chain GD = (n1 = k + 1, n2 = k, ..., nD = k). The Kirchoff index of the clique chain is given by a provided formula involving the number of nodes in each clique.

    The lower bound is calculated by constructing a subgraph as the cartesian product of a path graph PD and complete graph Kk. The Kirchoff index of this graph is computed using a formula involving the Laplacian spectra of the graphs.

    Lower and upper bounds of Kirchoff index of

    maximally controllable graph


    Aqsa Akber
    August 2018

    1 Upper Bound of Kirchoff Index of our graph


    To find the upper bound of our maximally robust graph, we can construct the
    supergraph of our graph which has the structure of a clique chain
    GD = (n1 = k + 1, n2 = k, k, ....., nD = k)

    Figure 1: Supergraph of our graph as clique chain GD = (n1 = k + 1, n2 =


    k, k, ....., nD = k) (extra edges are shown in green)

    Kirchoff Index of a clique chain is given by the following formula: [2]


    (N − q−1
    P
    k=1 nk ) nj −1
    PD+1 Pq−1 PD+1
    RG ∗D = q=2 nq −1nq k=1 nk + N j=1 nj −1+nj +nj +1

    e.g for N = 16, D =5, k = 3, corresponding clique chain as supergraph of


    our graph would be (4,3,3,3,3)
    (16− q−1
    P
    k=1 nk ) nj −1
    P6 Pq−1 P6
    RG ∗D = q=2 nq −1nq k=1 nk + 16 j=1 nj −1+nj +nj +1

    where nk = #of nodes in kth clique,


    nj = # of nodes in current (jth) clique
    nj − 1 = # of nodes in clique previous to jth clique

    1
    nj + 1= # of nodes in clique next to jth clique

    2 Lower bound of Kirchoff index of our graph


    Lower bound of Kirchoff Index is to be found by constructing a subgraph of our
    graph as a cartesian product of following two graphs:
    1. PD (Path graph with diameter D)
    2. Kk (Complete graph with k nodes)

    Figure 2: Subergraph of our graph as cartesian product of PD and Kk

    Kirchoff index of this graph is computed using the following formula [2]:
    PN 1
    Kf = N i=2 λi

    First, we need to find out the Laplacian spectra of above graph, which is inves-
    tigated in [1]
    Using the results of [1] , eigen values of graph cartesian product is given by
    λi = µp + ηq , 1 ≤ i ≤ N, 1 ≤ p ≤ D + 1, 1≤q≤k

    where µp are eigen values of PD and ηq are eigen values of Kk


    PD has eigenvalues

    µp = 2 − 2 cos π(p−1)
    D+1 , 1≤p≤D+1

    and eigenvalues of Kk are as follows:


    (
    0, q=1
    ηq =
    k, q = 2, ....., k
    The eigenvalues
    ( of graphs’cartesian product are as follows:
    2 − 2 cos π(p−1)
    D+1 , 1 ≤ p ≤ D + 1, 1≤i≤D+1
    λi =
    2 − 2 cos π(p−1)
    D+1 + k, 1 ≤ p ≤ D + 1, D +2≤i≤N

    2
    Now, the Kirchoff Index of graphs’ cartesian product is
    PD+1 1
    PN 1
    Kf = N i=2 π(p−1) +N i=D+2 2−2 cos π(p−1) 1≤p≤D+1
    2−2 cos D+1 D+1 +k

    References
    [1] S. Pati S. Barik, R. B. Bapat. On the laplacian spectra of product graphs.
    Applicable Analysis and Discrete Mathematics, 9:39–58, 2015.

    [2] P. Van Mieghem A. Jamakovic R.E. Kooij W. Ellens, F.M. Spieksma. Effec-
    tive graph resistance. Linear Algebra and its Applications, 435:2500, March
    2011.

    You might also like