The automorphism group and plain eigenvalues of a graph

IF 1 3区 数学 Q1 MATHEMATICS
Wei Wang, Xinyue Wang
{"title":"The automorphism group and plain eigenvalues of a graph","authors":"Wei Wang,&nbsp;Xinyue Wang","doi":"10.1016/j.laa.2025.05.011","DOIUrl":null,"url":null,"abstract":"<div><div>We introduce the <em>plain polynomial</em> associated with a graph <em>G</em>, which is defined to be the quotient of the characteristic polynomial and the main polynomial of <em>G</em>. For a graph <em>G</em> with a square-free plain polynomial, we establish an upper bound on the order of its automorphism group in terms of the number of irreducible factors of the plain polynomial over <span><math><mi>Q</mi></math></span>. This improves the previous upper bound using the characteristic polynomial (G. Criscuolo, C.-M. Kwok, A. Mowshowitz, and R. Tortora, The group and the minimal polynomial of a graph, J. Combin. Theory Ser. B 29 (1980) 293–302).</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"722 ","pages":"Pages 154-163"},"PeriodicalIF":1.0000,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linear Algebra and its Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0024379525002095","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We introduce the plain polynomial associated with a graph G, which is defined to be the quotient of the characteristic polynomial and the main polynomial of G. For a graph G with a square-free plain polynomial, we establish an upper bound on the order of its automorphism group in terms of the number of irreducible factors of the plain polynomial over Q. This improves the previous upper bound using the characteristic polynomial (G. Criscuolo, C.-M. Kwok, A. Mowshowitz, and R. Tortora, The group and the minimal polynomial of a graph, J. Combin. Theory Ser. B 29 (1980) 293–302).
图的自同构群和平面特征值
我们引入了与图G相关的平面多项式,它被定义为特征多项式与G的主多项式之商。对于具有无平方平面多项式的图G,我们根据其q上的平面多项式的不可约因子的个数建立了其自同构群的阶上界,改进了先前使用特征多项式的上界。郭,a . Mowshowitz和R. Tortora,图的群和最小多项式,J. Combin。Ser的理论。B 29(1980) 293-302)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.20
自引率
9.10%
发文量
333
审稿时长
13.8 months
期刊介绍: Linear Algebra and its Applications publishes articles that contribute new information or new insights to matrix theory and finite dimensional linear algebra in their algebraic, arithmetic, combinatorial, geometric, or numerical aspects. It also publishes articles that give significant applications of matrix theory or linear algebra to other branches of mathematics and to other sciences. Articles that provide new information or perspectives on the historical development of matrix theory and linear algebra are also welcome. Expository articles which can serve as an introduction to a subject for workers in related areas and which bring one to the frontiers of research are encouraged. Reviews of books are published occasionally as are conference reports that provide an historical record of major meetings on matrix theory and linear algebra.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信