TY - JOUR ID - 14391 TI - Normalized distance Laplacian matrices for signed graphs JO - Communications in Combinatorics and Optimization JA - CCO LA - en SN - 2538-2128 AU - ROY, ROSHNI T AU - K A, Germina AU - K, Shahul Hameed AD - RESEARCH SCHOLAR DEPARTMENT OF MATHEMATICS CENTRAL UNIVERSITY OF KERALA KASARAGOD, INDIA AD - Central University of Kerala, Kasaragod, India AD - Associate Professor, Department of Mathematics, K M M Government Women's College, Kannur, India. Y1 - 2023 PY - 2023 VL - 8 IS - 3 SP - 445 EP - 456 KW - Signed graphs KW - Weighted signed graphs KW - Normalized distance Laplacian matrix KW - Normalized distance Laplacian spectrum DO - 10.22049/cco.2022.27514.1282 N2 - 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. UR - http://comb-opt.azaruniv.ac.ir/article_14391.html L1 - http://comb-opt.azaruniv.ac.ir/article_14391_c66c8a9abab76abb8f61f607986a6b5a.pdf ER -