节点文献
完全二部图的图多项式及图的不同特征根个数的下界
ON THE POLYNOMIALS OF A COMPLETE BIPARTITE GRAPH AND THE LOWER BOUND FOR THE NUMBER OF DISTINCT EIGENVALUES OF GRAPH
【摘要】 本文首先圆满解决了完全二部图的图多项式问题;然后讨论了只有平凡多项式图的一类图的共同性质;最后利用图多项式给出了图G的不同特征根个数的新下界。
【Abstract】 In this paper, we have entirely determined the potynomials of a complete bipartite graph first. Next, some properties of graphs which only have the trivial polynomial graphs are obtained. Finally, a new lower-bound of the number of distinct eigenvalues of graph is given by means of the polynomial of graph.
【关键词】 图多项式;
平凡多项式图;
完全二部图;
θ(G);
【Key words】 polynomials of graph; trivial polynomial graphs; complete bipartite graph; θ(G).;
【Key words】 polynomials of graph; trivial polynomial graphs; complete bipartite graph; θ(G).;
- 【文献出处】 黄冈师专学报 ,Journal of Huanggang Normal University , 编辑部邮箱 ,1992年01期
- 【下载频次】59