82 research outputs found

    Unicyclic Graphs with equal Laplacian Energy

    Full text link
    We introduce a new operation on a class of graphs with the property that the Laplacian eigenvalues of the input and output graphs are related. Based on this operation, we obtain a family of order (square root of n) noncospectral unicyclic graphs on n vertices with the same Laplacian energy.Comment: 11 pages, 11 figures, slightly modified version of Theorem 1 when compared with original pape

    Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth

    Get PDF

    Limits of permutation sequences

    Get PDF
    A permutation sequence is said to be convergent if the density of occurrences of every fixed permutation in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue measurable function Z:[0,1]2→[0,1]Z:[0,1]^2 \to [0,1] with the additional properties that, for every fixed x∈[0,1]x \in [0,1], the restriction Z(x,⋅)Z(x,\cdot) is a cumulative distribution function and, for every y∈[0,1]y \in [0,1], the restriction Z(⋅,y)Z(\cdot,y) satisfies a "mass" condition. This limit process is well-behaved: every function in the class of limit objects is a limit of some permutation sequence, and two of these functions are limits of the same sequence if and only if they are equal almost everywhere. An ingredient in the proofs is a new model of random permutations, which generalizes previous models and might be interesting for its own sake.Comment: accepted for publication in the Journal of Combinatorial Theory, Series B. arXiv admin note: text overlap with arXiv:1106.166
    • …
    corecore