GRAPH SPECTRAL TECHNIQUES ON UNWEIGHTED NETWORK

T. Kiruthika , Y. Preethi Ceon

Eigen gap, Algebraic connectivity, Spectral gap, eigenvector centrality

In this paper, graph spectral techniques are used to analyzing the water distribution network. The strength of the network connectivity, most influential node and optimal number of clusters for the network partitioning are computed by eigenvalues and eigenvectors through its adjacency and laplacian matrix. This approach is based only on the topological and geometric information of the network.

Published Paper   E-Certificate

"GRAPH SPECTRAL TECHNIQUES ON UNWEIGHTED NETWORK", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.3, Issue 7, page no.102 - 107, July-2018, Available :https://ijsdr.org/papers/IJSDR1807016.pdf

Volume 3 Issue 7, July-2018

Pages : 102 - 107

Paper Reg. ID: IJSDR_180488

Published Paper Id: IJSDR1807016

Downloads: 000346998

Research Area: Applied Mathematics

Country: p.puliampatti, TAMILNADU, India

Published Paper PDF: https://ijsdr.org/papers/IJSDR1807016

Published Paper URL: https://ijsdr.org/viewpaperforall?paper=IJSDR1807016

ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Publisher: IJSDR(IJ Publication) Janvi Wave

This work is licensed under a Creative Commons Attribution 4.0 International License and The Open Definition