摘要
关于混合图■的H-秩,李书超等人证明了2m(G)-2c(■)≤rk(G)≤2m(G)+c(G)。本文证明了不存在rk(■)=2m(G)-2c(G)+1的混合图,并且存在无穷多个连通混合图■,满足c(G)=k,rk(■)=2m(G)-2c(G)+l,其中k,l是满足0≤l≤3k,l≠1的整数。
For any mixed graph ■,Li et al. proved that 2 m(G)-2 c(G) ≤rk(■) ≤2 m(G) +c(G). In this paper,we prove that there is no mixed graph ■ with rk(■) =2 m(G)-2 c(G) +1,and there are infinitely many connected mixed graphs ■ such that c(G) =k and rk(G) =2 m(G)-2 c(G) +l for every integers k,l satisfying 0 ≤l ≤3 k, l ≠1.
作者
朱佳敏
李双东
ZHU Jiamin;LI Shuangdong(School of Mathematical Sciences,Anhui University,Hefei 230601,China;Jianghuai College of Anhui University,Hefei 230031,China)
出处
《安徽建筑大学学报》
2021年第6期49-54,共6页
Journal of Anhui Jianzhu University
基金
国家自然科学基金项目(11871071,11771016,11871073)。
关键词
混合图
H-秩
匹配数
圈空间维数
mixed graph
H-rank
matching number
cyclomatic number