Research problem: The completion number of a graph
组合数学
2007-05-23 v1 泛函分析
摘要
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.
引用
@article{arxiv.math/0312390,
title = {Research problem: The completion number of a graph},
author = {M. Bakonyi and T. Constantinescu},
journal= {arXiv preprint arXiv:math/0312390},
year = {2007}
}
备注
6 pages