Normalized distance Laplacian matrices for signed graphs

Communications in Combinatorics and Optimization

article

ROSHNI T ROY¹  Germina K A²  Shahul Hameed K³ 

[1] RESEARCH SCHOLAR DEPARTMENT OF MATHEMATICS CENTRAL UNIVERSITY OF KERALA KASARAGOD;Central University of Kerala;Department of Mathematics, K M M Government Women's College

关键词: Signed graphs;    Weighted signed graphs;    Normalized distance Laplacian matrix;    Normalized distance Laplacian spectrum;   

DOI  :  10.22049/cco.2022.27514.1282

学科分类：社会科学、人文和艺术（综合）

来源: Azarbaijan Shahide Madani Universit

【 摘 要 】

In this paper, we introduce the notion of normalized distance Laplacian matrices for signed graphs corresponding to the two signed distances defined for signed graphs. We characterize balance in signed graphs using these matrices and compare the normalized distance Laplacian spectral radius of signed graphs with that of all-negative signed graphs. Also we characterize the signed graphs having maximum normalized distance Laplacian spectral radius.

【 授权许可】

CC BY-SA