61,796 research outputs found

    Graphs with small diameter determined by their DD-spectra

    Get PDF
    Let GG be a connected graph with vertex set V(G)={v1,v2,...,vn}V(G)=\{v_{1},v_{2},...,v_{n}\}. The distance matrix D(G)=(dij)n×nD(G)=(d_{ij})_{n\times n} is the matrix indexed by the vertices of G,G, where dijd_{ij} denotes the distance between the vertices viv_{i} and vjv_{j}. Suppose that λ1(D)λ2(D)λn(D)\lambda_{1}(D)\geq\lambda_{2}(D)\geq\cdots\geq\lambda_{n}(D) are the distance spectrum of GG. The graph GG is said to be determined by its DD-spectrum if with respect to the distance matrix D(G)D(G), any graph having the same spectrum as GG is isomorphic to GG. In this paper, we give the distance characteristic polynomial of some graphs with small diameter, and also prove that these graphs are determined by their DD-spectra

    B\"acklund-Darboux Transformations and Discretizations of Super KdV Equation

    Full text link
    For a generalized super KdV equation, three Darboux transformations and the corresponding B\"acklund transformations are constructed. The compatibility of these Darboux transformations leads to three discrete systems and their Lax representations. The reduction of one of the B\"acklund-Darboux transformations and the corresponding discrete system are considered for Kupershmidt's super KdV equation. When all the odd variables vanish, a nonlinear superposition formula is obtained for Levi's B\"acklund transformation for the KdV equation
    corecore