Research problem: The completion number of a graph
Bakonyi, M. · Constantinescu, T.
Original · EN
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we ask for a graph theoretic characterization of those graphs with a given completion number.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.