符号Wenger图的主特征值
The Main Eigenvalues of Signed Wenger Graphs
DOI: 10.12677/ORF.2023.135487, PDF,    科研立项经费支持
作者: 向明跃, 章 超*:贵州大学数学与统计学院,贵州 贵阳
关键词: 邻接矩阵主特征值Wenger图Adjacency Matrix Main Eigenvalue Wenger Graph
摘要: 是一个符号图,的特征值是其邻接矩阵的特征值。设的一个特征值,如果存在属于的一个特征向量,使得,则称的主特征值。图的主特征值为研究图的性质和图的其它不变量都有重要的意义,它在化学等领域中有重要的应用。在的顶点Vi处做切换,相当于改变特征值的特征向量中元素Ui的符号。由于的切换可以改变它的主特征值。因此,给出某些图类的每个特征值都有一无零元素的特征向量具有重要意义。在本文中,我们主要证明了Wenger图的任意特征值对应的特征空间都包含一个无零元素的向量。进一步,我们证明了符号Wenger图在任意地一个顶点处做切换都会使得它的所有特征值变为主特征值。
Abstract: Let be a signed graph and the eigenvalue of be the eigenvalue of its adjacency matrix. An eigenvalue of a signed graph is called a main eigenvalue if it has an eigenvector such that the sum of whose entries is not zero. The main eigenvalue of a graph is of great significance to study the properties of a graph and other invariants of a graph. It has important applications in chemistry and other fields. Switching at the vertex Vi of  is equivalent to changing the sign of the elements Ui in the eigenvector of the eigenvalue . The switching of can change its main eigenvalue. Therefore, it is important to show that every eigenvalue of some graph class has a nowherezero eigenvector. In this paper, we mainly prove that the eigenspace corresponding to any eigenvalue of the Wenger graph contains a nowherezero eigenvector. It is further more prove that all eigenvalues of signed Wenger graphs will become the main eigenvalues when switching at any vertex.
文章引用:向明跃, 章超. 符号Wenger图的主特征值[J]. 运筹与模糊学, 2023, 13(5): 4849-4855. https://doi.org/10.12677/ORF.2023.135487

参考文献

[1] Cvetkovic, D. (1978) The Main Part of the Spectrum, Divisors and Switching of Graphs. Publications de L’Institut Mathématique [Elektronische Ressource], 23, 31-38. https://zbmath.org/?q=an:0423.05028
[2] Hou, Y.P. and Tian, F. (2006) Unicyclic Graphs with Exactly Two Main Eigenvalues. Applied Mathematics Letters, 19, 1143-1147. [Google Scholar] [CrossRef
[3] Hou, Y.P., Tang, Z.K. and Shiu, W.C. (2012) Some Results on Graphs with Exactly Two Main Eigenvalues. Applied Mathematics Letters, 25, 1274-1278. [Google Scholar] [CrossRef
[4] Huang, X.Y., Huang, Q.X. and Lu, L. (2015) Construction of Graphs with Exactly k Main Eigenvalues. Linear Algebra and Its Applications, 486, 204-218. [Google Scholar] [CrossRef
[5] Du, Z.N., Liu, F.J., Liu, S.Y. and Qiu, Z.M. (2021) Graphs with n-1 Main Eigenvalues. Discrete Mathematics, 344, Article ID: 112397. [Google Scholar] [CrossRef
[6] Cvetković, D. and Fowler, P.W. (1999) A Group-Theoretical Bound for the Number of Main Eigenvalues of a Graph. Journal of Chemical Information and Computer Sciences, 39, 638-641. [Google Scholar] [CrossRef
[7] Cvetković, D. and Gutman, I. (1977) Note on Branching. Croatica Chemica Acta, 49, 115-121.
[8] Stanić, Z. (2020) Main Eigenvalues of Real Symmetric Matrices with Application to Signed Graphs. Czechoslovak Mathematical Journal, 70, 1091-1102. [Google Scholar] [CrossRef
[9] Akbari, S., Franca, F.A.M., Ghasemian, E., Ja-varsineh, M. and de Lima, L.S. (2021) The Main Eigenvalues of Signed Graphs. Linear Algebra and Its Applications, 614, 270-278. [Google Scholar] [CrossRef
[10] Shao, Z. and Yuan, X. (2022) Some Signed Graphs Whose Eigenvalues Are Main. Applied Mathematics and Computation, 423, Article ID: 127014. [Google Scholar] [CrossRef
[11] Wenger, R. (1991) Extremal Graphs with no C4’s, C6’s, or C10’s. Journal of Combinatorial Theory, Series B, 52, 113-116. [Google Scholar] [CrossRef
[12] Viglione, R. (2002) Properties of Some Algebra-ically Defined Graphs. Publications de L’Institut Mathématique, 23, 31-38. http://elib.mi.sanu.ac.rs/files/journals/publ/43/6.pdf
[13] Lazebnik, F. and Ustimenko, V. (1993) New Examples of Graphs without Small Cycles and of Large Size. European Journal of Combinatorics, 14, 445-460. [Google Scholar] [CrossRef
[14] Cioabă, S.M., Lazebnik, F. and Li, W. (2014) On the Spectrum of Wenger Graphs. Journal of Combinatorial Theory, Series B, 107, 132-139. [Google Scholar] [CrossRef
[15] Futorny, V. and Ustimenko, V. (2007) On Small World Semiplanes with Generalized Schubert Cells. Acta Applicandae Mathematicae, 98, 47-61. https://link.springer.com/article/10.1007/s10440-007-9144-8 [Google Scholar] [CrossRef
[16] Mader, W. (1971) Minimale n-Fach Kantenzusammen-hängende Graphen. Mathematische Annalen, 191, 21-28. [Google Scholar] [CrossRef
[17] Shao, J.Y., He, C.X. and Shan, H.Y. (2008) The Existence of Even Cycles with Specific Lengths in Wenger’s Graph. Acta Mathematicae Applicatae Sinica, English Series, 24, 281-288. https://link.springer.com/article/10.1007/s10255-006-6020-7 [Google Scholar] [CrossRef
[18] Viglione, R. (2008) On the Diameter of Wenger Graphs. Acta Applicandae Mathematicae, 104, 173-176. [Google Scholar] [CrossRef
[19] Johnson, C.R. and Sutton, B.D. (2004) Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components. SIAM Journal on Matrix Analysis and Applications, 26, 390-399. [Google Scholar] [CrossRef
[20] Akbari, S., Ghorbani, E. and Mahmoodi, A. (2013) Nowhere-Zero Eigenvectors of Graphs. Linear Multilinear Algebra, 61, 273-279. [Google Scholar] [CrossRef
[21] Lazebnik, F. and Viglione, R. (2002) An Infinite Series of Regular Edge—But Not Vertex-Transitive Graphs. Journal of Graph Theory, 41, 249-258. [Google Scholar] [CrossRef
[22] Godsi, C. and Royle, G.F. (2001) Algebraic Graph Theory. Spring-er-Verlag, New York. [Google Scholar] [CrossRef