符号图网拉普拉斯最大特征值的一个上界
An Upper Bound for the Largest Net Laplacian Eigenvalue of Signed Graphs
DOI: 10.12677/PM.2023.135146, PDF,   
作者: 刘 燕：福州大学，数学与统计学院，福建 福州
关键词: 符号图；网拉普拉斯矩阵；最大特征值；上界；Signed Graph； Net Laplacian Matrix； Largest Eigenvalue； Upper Bound
摘要: 本文给出了符号图Γ的网拉普拉斯最大特征值κ1的上界：σ(ij)表示边ij的符号；Ni,Ni+和Ni−分别表示顶点i的邻域、正邻域和负邻域；|U|表示集合U中所含元素的个数。
Abstract: An upper bound for the largest net Laplacian eigenvalue of a signed graph is given: an absolute value function; σ(ij) denotes the sign of edge ij; Ni,Ni+ and Ni− denotes its neighbourhood, the positive neighbourhood and the negative neighbourhood of a vertex i, respectively;|U| denotes the number of elements in a set U.
文章引用：刘燕. 符号图网拉普拉斯最大特征值的一个上界[J]. 理论数学, 2023, 13(5): 1425-1430. https://doi.org/10.12677/PM.2023.135146

参考文献

[1] Harary, F. (1953) On the Notion of Balance of a Signed Graph. Michigan Mathematical Journal, 2, 143-146. [Google Scholar] [CrossRef] 
[2] Zaslavsky, T. (1982) Signed Graphs. Discrete Applied Mathematics, 4, 47-74. [Google Scholar] [CrossRef] 
[3] Stanić, Z. (2020) Net Laplacian Controllability for Joins of Signed Graphs. Discrete Applied Mathematics, 285, 197-203. [Google Scholar] [CrossRef] 
[4] Gao, H., Ji, Z. and Hou, T. (2018) Equitable Partitions in the Controllability of Undirected Signed Graphs. 2018 IEEE 14th International Conference on Control and Automation (ICCA), Anchorage, AK, 12-15 June 2018, 532-537. [Google Scholar] [CrossRef] 
[5] Stanić, Z. (2020) On the Spectrum of the Net Laplacian Matrix of a Signed Graph. Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie, 63, 205-213.
[6] Ramezani, F. and Stanić, Z. (2022) Some Upper Bounds for the Net Laplacian Index of a Signed Graph. Bulletin of the Iranian Mathematical Society, 48, 243-250. [Google Scholar] [CrossRef] 
[7] Zaslavsky, T. (2010) Matrices in the Theory of Signed Simple Graphs. In: Acharya, B.D., Katona, G.O.H. and Nesetril, J., Eds., Advances in Discrete Mathematics and Applications: Mysore, 2008 (ICDM-2008, Mysore, India), Vol. 13, Ramanujan Mathematical Society, Mysore, 207-229.
[8] Stanić, Z. (2019) Bounding the Largest Eigenvalue of Signed Graphs. Linear Algebra and Its Applications, 573, 80-89. [Google Scholar] [CrossRef] 

为你推荐