Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Geoff Tims"'
Autor:
Geoff Tims
Haemers’ minimum rank, η(G), was first defined by Willem Haemers in 1979. He created this graph parameter as an upper bound for the Shannon capacity of a graph, Θ(G), and to answer some questions asked by Lovasz in his famous paper where he deter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39dcf7193d172c5b604652d2ca074971
https://doi.org/10.31274/etd-180810-3393
https://doi.org/10.31274/etd-180810-3393
Publikováno v:
Linear Algebra and its Applications. 432:2995-3001
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ij th entry (for i ≠ j ) is nonzero whenever { i , j } is an edge in G and is zero otherwise. Minimum rank is a difficult parame
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcdda38637f09f77a873de99d16df9b7
https://doi.org/10.1016/j.laa.2010.01.008
https://doi.org/10.1016/j.laa.2010.01.008
