algebraic graph theory

التعريفات والمعاني

== English == === Noun === algebraic graph theory (countable and uncountable, plural algebraic graph theories) (uncountable, mathematics, graph theory) The subbranch of graph theory in which algebraic methods are applied to problems about graphs. (countable, applied mathematics) A theory developed by applying algebraic graph theory to a particular problem or application. 1999, B. Kumar, B. H. V. Topping, Developments in Analysis and Design Using Finite Element Methods, Civil-Comp Press, page 25, Recently hybrid methods are proposed by Kaveh [2] and Kaveh et al. [18] which employ graph and algebraic graph theories simultaneously for domain decomposition of FE meshes and their nodal ordering. 2019, Zhi-Hong Guan, Bin Hu, Xuemin (Sherman) Shen, Introduction to Hybrid Intelligent Networks, Springer, page 22, Mathematical tools such as hybrid dynamical systems, complex networks, differential equations, and algebraic graph theories are introduced for modeling and analyzing the hybrid intelligent networks. ==== Translations ==== === Further reading === Algebraic combinatorics on Wikipedia.Wikipedia Graph property on Wikipedia.Wikipedia Algebraic connectivity on Wikipedia.Wikipedia Adjacency matrix on Wikipedia.Wikipedia Laplacian matrix on Wikipedia.Wikipedia Spectral graph theory on Wikipedia.Wikipedia