Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/713
Title: On the spectrum of the net Laplacian matrix of a signed graph
Authors: Stanić, Zoran 
Affiliations: Numerical Mathematics and Optimization 
Keywords: (Net) Laplacian matrix;Graph product;Join;Largest eigenvalue
Issue Date: 1-Jan-2020
Journal: Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie
Abstract: 
Given a signed graph G, let Ag, and D±g be its standard adjacency matrix and the diagonal matrix of vertex net-degrees, respectively. The net Laplacian matrix of G is defined to be Ng = D±g - Ag. In this paper we give some spectral properties of Ng. We also point out some advantages and some disadvantages of using the net Laplacian matrix instead of the standard Laplacian matrix in study of signed graphs.
URI: https://research.matf.bg.ac.rs/handle/123456789/713
ISSN: 12203874
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

6
checked on Nov 8, 2024

Page view(s)

14
checked on Nov 15, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.