淡江大學機構典藏:Item 987654321/58526
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62797/95867 (66%)
造访人次 : 3731690      在线人数 : 624
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/58526


    题名: Connected graphs with maximal Q-index: the one-dominating-vertex case
    作者: Chang, Ting-Chung;Tam, Bit-Shun
    贡献者: 淡江大學數學學系
    关键词: Graph spectra;Signless Laplacian;Maximal Q-index problem;Line graph;Threshold graph
    日期: 2011-11
    上传时间: 2011-10-01 12:15:26 (UTC+8)
    出版者: Philadelphia: Elsevier Inc.
    摘要: By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G),D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. For every pair of positive integers n,k, it is proved that if 3⩽k⩽n-3, then Hn,k, the graph obtained from the star K1,n-1 by joining a vertex of degree 1 to k+1 other vertices of degree 1, is the unique connected graph that maximizes the largest signless Laplacian eigenvalue over all connected graphs with n vertices and n+k edges.
    關聯: Linear Algebra and its Applications 435(10), pp.2451-2461
    DOI: 10.1016/j.laa.2011.02.018
    显示于类别:[數學學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    Connected graphs with maximal Q-index the one-dominating-vertex case.pdf246KbAdobe PDF1检视/开启
    index.html0KbHTML257检视/开启
    index.html0KbHTML92检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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