Premium
On optimal cycle bases of graphs for mesh analysis of networks
Author(s) -
Kaveh A.
Publication year - 1989
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230190302
Subject(s) - adjacency matrix , cycle basis , adjacency list , computer science , graph , basis (linear algebra) , matrix (chemical analysis) , selection (genetic algorithm) , algorithm , mathematics , combinatorics , theoretical computer science , artificial intelligence , line graph , materials science , geometry , graph power , composite material
An algorithm is developed for the selection of a cycle basis of a graph which corresponds to a highly sparse cycle adjacency matrix, hence providing an efficient means for the mesh analysis of networks. Unlike the existing methods, this algorithm reduces the overlaps of the cycles instead of their lengths. The results are compared with those of the previous methods through some examples. The cycles are also ordered to obtain banded cycle adjacency matrices.