| 关于图多项式的一个问题 |
| |
| 引用本文： | 李登信. 关于图多项式的一个问题[J]. 青海师范大学学报(自然科学版), 1991, 0(3): 8-11 |
| |
| 作者姓名： | 李登信 |
| |
| 作者单位： | 渝州大学 |
| |
| 摘 要： | 本文利用图的邻接矩阵的最小多项式,定出了两类只有平凡的多项式图的图。为解答文献[3]提出的一个问题,给出了两个充分条件。
|
| 关 键 词： | 图多项式 邻接矩阵 星图 图论 |
ON A PROBLEM OF POLYNOMIALS ON GRAPH |
| |
| Li Dengxin. ON A PROBLEM OF POLYNOMIALS ON GRAPH[J]. Journal of Qinghai Normal University(Natural Science Edition), 1991, 0(3): 8-11 |
| |
| Authors: | Li Dengxin |
| |
| Affiliation: | Yuzhou University |
| |
| Abstract: | Let G be a simple graph with adjacency matrix A, and p (x) is a polynomial with rational coefficients. When a polynomial in the adjacency matrix of a graph will yield the adjacency matrix of another graph? This remains an unsolved problem. In this paper, we give a partial solution to the question of [3]. |
| |
| Keywords: | Polynomials on Graph Adjacency matrix. |
| 本文献已被 CNKI 维普 等数据库收录！ |
