完全图的单钩immanant（英文）  

Single-hook Immanants for Complete Graph

作　　者：于桂海 侯耀平[2] 曲慧 YU Guihai;HOU Yaoping;QU Hui(College of Big Data Statistics,Guizhou University of Finance and Economics,Guiyang,Guizhou,550025,P.R.China;School of Mathematics and Computer Science,Hunan Normal University,Changsha,Hunan,410081,P.R.China;School of Mathematics and Statistics,Guizhou University of Finance and Economics,Guiyang,Guizhou,550025,P.R.China)

机构地区：[1]贵州财经大学大数据统计学院,贵州贵阳550025 [2]湖南师范大学数学与计算机学院,湖南长沙410081 [3]贵州财经大学数学与统计学院,贵州贵阳550025

出　　处：《数学进展》2019年第6期692-698,共7页Advances in Mathematics（China）

基　　金：Supported by NSFC(Nos.11301302,11861019);Guizhou Talent Development Project in Science and Technology(No.KY[2018]046);Natural Science Foundation of Guizhou(Nos.[2019]1047,[2018]5774-006,[2018]5774-021);Foundation of Chongqing Science and Technology Commission(No.CSTC2014jcyjA00004);Foundation of Shandong Provincial Education Department(No.J17KA165)

摘　　要：众所周知,immanant的计算是很困难的.本文分别给出了具有n个顶点的完全图的邻接矩阵和拉普拉斯矩阵的单钩immanant的递推关系式;此外,还分别给出了具有n个顶点的圈的邻接矩阵和拉普拉斯矩阵的积和式的值.As we know,the computation of immanants is very difficult.In this paper we determine a recursive expression of single-hook immanants of the adjacency matrices and Laplacian matrices of complete graphs on n vertices,respectively.In addition,the values of the permanents of the adjacency matrices and Laplacian matrices of cycles on n vertices are given,respectively.

关 键 词：单钩immanant 邻接矩阵 拉普拉斯矩阵 完全图 

分 类 号：O157.5[理学—数学]