A characterization of graphs G with nullity |V(G)|–2m(G)＋2c(G)

淡江大學機構典藏 > 理學院 > 數學學系暨研究所 > 期刊論文 > Item 987654321/103418

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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.pdf		349Kb	Adobe PDF	1	檢視/開啟
index.html		0Kb	HTML	202	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章