Abstract
Abstract In this paper we investigate the upper bound on the smallest number of cliques that cover the vertices of graph G in terms of the rank of a matrix associated with it. Let X be real matrix that is indexed by vertices of G such that all its diagonal entries are non-zero and Xij = 0 whenever vertices i,j are non-adjacent. Then χ (G)≤ 3 rk(X)/2
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
