English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51254/86278 (59%)
造訪人次 : 8000841      線上人數 : 99
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/89144

    題名: Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
    作者: Huang, Liang-Hao;Tam, Bit-Shun;Wu, Shu-Hui
    貢獻者: 淡江大學數學學系
    關鍵詞: Rank;Adjacency matrix;Reduced adjacency matrix;Reduced graph;Number of distinct nonzero rows;Cograph;Neighborhood equivalence classes
    日期: 2013-05-15
    上傳時間: 2013-05-22 10:41:06 (UTC+8)
    出版者: Philadelphia: Elsevier Inc.
    摘要: For a simple graph G, let rank(G) and dnzr(G) denote respectively the rank and the number of distinct nonzero rows of the adjacency matrix A(G) of G. Equivalent conditions are given for the join G1∨G2 of two vertex-disjoint graphs G1,G2 to satisfy rank(G1∨G2)=dnzr(G1∨G2). A new proof is provided for the known relation rank(G) = dnzr(G) for cographs G. Our approach relies on the concepts of neighborhood equivalence classes, reduced graph and reduced adjacency matrix, and also on a known result that relates the spectrum of the adjacency matrix of a graph with that of its reduced adjacency matrix as well as a new characterization of the nonsingularity of a real symmetric matrix in a special 2 × 2 block form. Our treatment provides ways to construct graphs G, other than cographs, that satisfy rank(G) = dnzr(G). As a side result we also show that every rational number is equal to the sum of the entries of the inverse of the adjacency matrix of a connected nonsingular graph.
    關聯: Linear Algebra and its Applications 438(10), pp.4008-4040
    DOI: 10.1016/j.laa.2012.06.027
    顯示於類別:[數學學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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