Nodal domain count and vertex bipartiteness
首发时间:2015-12-04
Abstract: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$.
keywords: nodal domain count, vertex bipartiteness, independent number, diameter, chromatic number
点击查看论文中文信息
图的节点域个数与顶点二部度
摘要:本文建立图的节点域个数和顶点二部度之间的关系,分别用图的独立数,直径,色数给出节点域计数的上界或下界, 并刻画了节点域个数为$4$的联通图。
基金:
论文图表:
引用
No.4666784809291144****
同行评议
勘误表
图的节点域个数与顶点二部度
评论
全部评论0/1000