Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Mathematics
Perturbed Laplacian Matrix And The Structure Of A Graph., Sukanta Pati Dr.
Perturbed Laplacian Matrix And The Structure Of A Graph., Sukanta Pati Dr.
Doctoral Theses
Laplacian matrices Let G be a connected simple graph with vertex set V = {1,2,.,n), edge set E and let each edge be associated with a positive number, the weight of the edge. The above graph is called a weighted graph. An unweighted graph is just a weighted graph with each of the edges bearing weight 1. All the graphs considered are weighted and simple, unless specified otherwise; all the matrices considered are real. The adjacency matrix A(G) related to this graph is defined as A(G) = (aij), whereaij, if (i, j] € E and the weight of the edge …