淡江大學機構典藏:Item 987654321/58766
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64178/96951 (66%)
Visitors : 9367078      Online Users : 14290
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/58766


    Title: On the reduced signless Laplacian spectrum of a degree maximal graph
    Authors: Tam, Bit-Shun;Wu, Shu-Hui
    Contributors: 淡江大學數學學系
    Keywords: Degree maximal graph;Reduced signless Laplacian;Signless Laplacian spectrum;Characteristic polynomial;Neighborhood equivalence class
    Date: 2010-03-15
    Issue Date: 2011-10-01 21:09:37 (UTC+8)
    Publisher: Philadelphia: Elsevier Inc.
    Abstract: For a (simple) graph G, the signless Laplacian of G is the matrix A(G)+D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix Δ(G)+B(G), where B(G) is the reduced adjacency matrix of G and Δ(G) is the diagonal matrix whose diagonal entries are the common degrees for vertices belonging to the same neighborhood equivalence class of G. A graph is said to be (degree) maximal if it is connected and its degree sequence is not majorized by the degree sequence of any other connected graph. For a maximal graph, we obtain a formula for the characteristic polynomial of its reduced signless Laplacian and use the formula to derive a localization result for its reduced signless Laplacian eigenvalues, and to compare the signless Laplacian spectral radii of two well-known maximal graphs. We also obtain a necessary condition for a maximal graph to have maximal signless Laplacian spectral radius among all connected graphs with given numbers of vertices and edges.
    Relation: Linear Algebra and its Applications 432(7), pp.1734-1756
    DOI: 10.1016/j.laa.2009.11.031
    Appears in Collections:[Department of Applied Mathematics and Data Science] Journal Article

    Files in This Item:

    File Description SizeFormat
    0024-3795_432(7)p1734-1756.pdf313KbAdobe PDF264View/Open
    0024-3795_432(7)p1734-1756.pdf313KbAdobe PDF1View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback