图的节点域个数与顶点二部度
Nodal domain count and vertex bipartiteness
本文建立图的节点域个数和顶点二部度之间的关系,分别用图的独立数,直径,色数给出节点域计数的上界或下界, 并刻画了节点域个数为$4$的联通图。
We establish a novel relation between the nodal domain count and the vertex bipartiteness of a graph, give upper and/or lower bound for the nodal domain count of a graph in terms ofthe independent number, and the diameter, and the chromatic number, and characterize the (connected) graphs $G$ withnodal domain count $4$.
骆左娟、周波
数学
节点域个数 顶点二部度 独立数直径色数
nodal domain count vertex bipartiteness independent number diameter chromatic number
骆左娟,周波.图的节点域个数与顶点二部度[EB/OL].(2015-12-04)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/201512-296.点此复制
评论