检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Bilal Ahmad RATHER Shariefuddin PIRZADA Guo Fei ZHOU
机构地区:[1]Department of Mathematics,University of Kashmir,Srinagar,India [2]Department of Mathematics,Nanjing University,Nanjing 210093,P.R.China
出 处:《Acta Mathematica Sinica,English Series》2023年第4期603-617,共15页数学学报(英文版)
基 金:Supported by SERB-DST,New Delhi,under the research project number MTR/2017/000084;the third author is supported by NSFC (Grant Nos.11931006 and 11971011)。
摘 要:For a finite group G,the power graph P(G)is a simple connected graph whose vertex set is the set of elements of G and two distinct vertices x and y are adjacent if and only if x^(i)=y or y^(i)=x,for 2≤i,j≤n.In this paper,we obtain the distance Laplacian spectrum of power graphs of finite groups such as cyclic groups,dihedral groups,dicyclic groups,abelian groups and elementary abelian p groups.Moreover,we find the largest and second smallest distance Laplacian eigenvalue of power graphs of such groups.
关 键 词:Laplacian matrix distance Laplacian matrix finite groups power graphs
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.85