淡江大學機構典藏:Item 987654321/109351
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 63190/95884 (66%)
造访人次 : 4597190      在线人数 : 313
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/109351


    题名: A NOTE ON THE LEAST (NORMALIZED) LAPLACIAN EIGHVA;UE OF SIGNED GRAPHS
    作者: Li, Hui Shu;Li, Hong Hai
    关键词: signed graph;Laplacian;eigenvalues;balancedness
    日期: 2016-09
    上传时间: 2017-01-17 09:33:54 (UTC+8)
    出版者: 淡江大學出版中心
    摘要: Let Γ=(G,σ)Γ=(G,σ) be a connected signed graph, and L(Γ)L(Γ) be its Laplacian and L(Γ)L(Γ) its normalized Laplacian with eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn and μ1≥μ2≥⋯≥μnμ1≥μ2≥⋯≥μn, respectively. It is known that a signed graph ΓΓ is balanced if and only if λn=0λn=0 (or μn=0μn=0). We show that λnλn and μnμn measure how much ΓΓ is far from being balanced by proving that
    μn(Γ)λn(Γ)≤min{2ϵ(Γ)m,ν(Γ)ν(Γ)+ν1(Γ)},≤min{λ1(Γ′):Γ−Γ′isbalanced},
    μn(Γ)≤min{2ϵ(Γ)m,ν(Γ)ν(Γ)+ν1(Γ)},λn(Γ)≤min{λ1(Γ′):Γ−Γ′isbalanced},
    where ν(Γ)ν(Γ) (resp. ϵ(Γ)ϵ(Γ)) denotes the frustration number (resp. the frustration index) of ΓΓ, that is the minimum number of vertices (resp. edges) to be deleted such that the signed graph is balanced.
    關聯: Tamkang Journal of Mathematics 47(3), pp.271-278
    DOI: 10.5556/j.tkjm.47.2016.1942
    显示于类别:[淡江數學期刊] 第47卷第3期

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML472检视/开启

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

    TAIR相关文章

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