Algebraic Graph Theory: COLOURING PROBLEMS
Algebraic Graph Theory: COLOURING PROBLEMS
复制标题
DOI：
10.1017/cbo9780511608704
复制
发表时间：
1974
期刊：
影响因子：
--
通讯作者：
N. Biggs
中科院分区：
文献类型：
--
作者：
N. Biggs
1.代数图论导论第一部分。图学中的线性代数：2。图3的频谱。规则图和线图4.循环和削减5.生成树和相关结构6.第七棵树。决定性扩展8.顶点划分与谱第二部分。第九章：第九章10.第10集11.第十一章12.第12章. 13.我的超次元帝国14.第一次约会色多项式和生成树第三部分。对称性和规则性：15。16.第16话17.第一次约会18.第十八章19.第二次世界大战覆盖图构造20. 21.第二十一章十字路口阵列的可行性23. honeymoon给定围长参考指数的极小正则图。
1. Introduction to algebraic graph theory Part I. Linear Algebra in Graphic Thoery: 2. The spectrum of a graph 3. Regular graphs and line graphs 4. Cycles and cuts 5. Spanning trees and associated structures 6. The tree-number 7. Determinant expansions 8. Vertex-partitions and the spectrum Part II. Colouring Problems: 9. The chromatic polynomial 10. Subgraph expansions 11. The multiplicative expansion 12. The induced subgraph expansion 13. The Tutte polynomial 14. Chromatic polynomials and spanning trees Part III. Symmetry and Regularity: 15. Automorphisms of graphs 16. Vertex-transitive graphs 17. Symmetric graphs 18. Symmetric graphs of degree three 19. The covering graph construction 20. Distance-transitive graphs 21. Feasibility of intersection arrays 22. Imprimitivity 23. Minimal regular graphs with given girth References Index.