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


Some relations between rank of a graph and its complement
Authors:Saieed Akbari  Alireza Alipour  Javad Ebrahimi Boroojeni  Mirhamed Mirjalalieh Shirazi
Institution:a Department of Mathematical Sciences, Sharif University of Technology, P.O. Box 11365-9415, Tehran, Iran
b Institute for Studies in Theoretical Physics and Mathematics, Tehran, Iran
Abstract:Let G be a graph of order n and rank(G) denotes the rank of its adjacency matrix. Clearly, View the MathML source. In this paper we characterize all graphs G such that View the MathML source or n + 2. Also for every integer n ? 5 and any k, 0 ? k ? n, we construct a graph G of order n, such that View the MathML source.
Keywords:05C50  15A03
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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