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


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


    题名: A characterization of graphs G with nullity |V(G)|–2m(G)+2c(G)
    作者: Song, Ya-zhi;Song, Xiao-qiu;Tam Bit-Shun
    关键词: Nullity;Rank;Matching number
    日期: 2015-01-15
    上传时间: 2015-07-22 18:18:09 (UTC+8)
    摘要: By |V(G)|, |E(G)|, η(G), and m(G) we denote respectively the order, the number of edges, the nullity, and the matching number of a (simple) graph G. Recently Wang and Wong have proved that for every graph G , η(G)≤|V(G)|−2m(G)+2c(G), where c(G)=|E(G)|−|V(G)|+θ(G), θ(G) being the number of connected components of G. In this paper graphs G that satisfy the equality η(G)=|V(G)|−2m(G)+2c(G) are characterized.
    關聯: Linear Algebra and its Applications 465, pp.363-375
    DOI: 10.1016/j.laa.2014.09.034
    显示于类别:[數學學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A characterization of graphs G with nullity.pdf349KbAdobe PDF0检视/开启
    index.html0KbHTML149检视/开启

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

    TAIR相关文章

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