首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The swap graph of the finite soluble groups
Authors:Marco Di Summa  Andrea Lucchini
Institution:1.State University of Novi Pazar,Novi Pazar,Serbia;2.Mathematical Institute SANU,Belgrade,Serbia;3.Faculty of Informatics and Computing,Singidunum University,Belgrade,Serbia;4.Department of Mathematics,Kuwait University,Safat,Kuwait
Abstract:A graph is reflexive if the second largest eigenvalue of its adjacency matrix is less than or equal to 2. In this paper, we characterize trees whose line graphs are reflexive. It turns out that these trees can be of arbitrary order—they can have either a unique vertex of arbitrary degree or pendant paths of arbitrary lengths, or both. Since the reflexive line graphs are Salem graphs, we also relate some of our results to the Salem (graph) numbers.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号