IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3467158.html
   My bibliography  Save this article

More on Spectral Analysis of Signed Networks

Author

Listed:
  • Guihai Yu
  • Hui Qu

Abstract

Spectral graph theory plays a key role in analyzing the structure of social (signed) networks. In this paper we continue to study some properties of (normalized) Laplacian matrix of signed networks. Sufficient and necessary conditions for the singularity of Laplacian matrix are given. We determine the correspondence between the balance of signed network and the singularity of its Laplacian matrix. An expression of the determinant of Laplacian matrix is present. The symmetry about of eigenvalues of normalized Laplacian matrix is discussed. We determine that the integer is an eigenvalue of normalized Laplacian matrix if and only if the signed network is balanced and bipartite. Finally an expression of the coefficient of normalized Laplacian characteristic polynomial is present.

Suggested Citation

  • Guihai Yu & Hui Qu, 2018. "More on Spectral Analysis of Signed Networks," Complexity, Hindawi, vol. 2018, pages 1-6, October.
  • Handle: RePEc:hin:complx:3467158
    DOI: 10.1155/2018/3467158
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/3467158.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2018/3467158.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/3467158?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Yu, Guihai & Qu, Hui & Tu, Jianhua, 2015. "Inertia of complex unit gain graphs," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 619-629.
    2. Yu, Guihai & Liu, Xin & Qu, Hui, 2017. "Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 287-292.
    3. Lang, Rongling & Li, Tao & Mo, Desen & Shi, Yongtang, 2016. "A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 115-121.
    4. Yu Liu & Lihua You, 2014. "Further Results on the Nullity of Signed Graphs," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-8, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cao, Shujuan & Dehmer, Matthias & Kang, Zhe, 2017. "Network Entropies Based on Independent Sets and Matchings," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 265-270.
    2. Yong Lu & Ligong Wang & Qiannan Zhou, 2019. "The rank of a complex unit gain graph in terms of the rank of its underlying graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 570-588, August.
    3. Goubko, Mikhail, 2018. "Maximizing Wiener index for trees with given vertex weight and degree sequences," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 102-114.
    4. Li, Fengwei & Ye, Qingfang & Sun, Yuefang, 2017. "On edge-rupture degree of graphs," Applied Mathematics and Computation, Elsevier, vol. 292(C), pages 282-293.
    5. Yu, Guihai & Liu, Xin & Qu, Hui, 2017. "Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 287-292.
    6. Lan, Yongxin & Li, Tao & Ma, Yuede & Shi, Yongtang & Wang, Hua, 2018. "Vertex-based and edge-based centroids of graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 445-456.
    7. Lang, Rongling & Li, Tao & Mo, Desen & Shi, Yongtang, 2016. "A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 115-121.
    8. Ji, Shengjin & Liu, Mengmeng & Wu, Jianliang, 2018. "A lower bound of revised Szeged index of bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 480-487.
    9. Köberle, Alexandre C. & Garaffa, Rafael & Cunha, Bruno S.L. & Rochedo, Pedro & Lucena, André F.P. & Szklo, Alexandre & Schaeffer, Roberto, 2018. "Are conventional energy megaprojects competitive? Suboptimal decisions related to cost overruns in Brazil," Energy Policy, Elsevier, vol. 122(C), pages 689-700.
    10. Yu, Guihai & Qu, Hui & Dehmer, Matthias, 2017. "Principal minor version of Matrix-Tree theorem for mixed graphs," Applied Mathematics and Computation, Elsevier, vol. 309(C), pages 27-30.
    11. Lei, Hui & Li, Tao & Ma, Yuede & Wang, Hua, 2018. "Analyzing lattice networks through substructures," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 297-314.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:3467158. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.