Research problem: The completion number of a graph

Simple item page
dc.creatorBakonyi, M.
dc.creatorConstantinescu, T.
dc.date2003-12-19
dc.date.accessioned2026-07-07T05:04:05Z
dc.date.available2026-07-07T05:04:05Z
dc.descriptionMotivated 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/math/0312390
dc.identifierhttp://arxiv.org/abs/math/0312390
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69666
dc.subjectCombinatorics
dc.subjectFunctional Analysis
dc.titleResearch problem: The completion number of a graph
dc.typetext

Files

Collections

arXiv