首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The minimum rank problem over the finite field of order 2: Minimum rank 3
Authors:Wayne Barrett  Raphael Loewy
Institution:a Department of Mathematics, Brigham Young University, Provo, UT 84602, USA
b Department of Mathematics, Iowa State University, Ames, IA 50011, USA
c Department of Mathematics, Technion-Israel Institute of Technology, Haifa 32000, Israel
Abstract:Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by exploring how some of these results over the finite field of order 2 extend to arbitrary fields and demonstrate that at least one third of the 62 are minimal forbidden subgraphs over an arbitrary field for the class of graphs having minimum rank at most 3 in that field.
Keywords:Primary: 05C50  Secondary: 05C75  15A03
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号