English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 54451/89232 (61%)
造訪人次 : 10572420      線上人數 : 41
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: 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檢視/開啟



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