|Table of Contents|

Decomposing Method in Pair of Graph realization(PDF)

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
1999年06期
Page:
494-498
Research Field:
Publishing date:

Info

Title:
Decomposing Method in Pair of Graph realization
Author(s):
QianJianping
School of Information,NUST,Nanjing 210094
Keywords:
network analysis mat rix decomposit ion
PACS:
O157.6
DOI:
-
Abstract:
In Mayeda’ s method f rom mat rix to graph, there is a dif ficulty in forming a pair M submatrix, w ith many H submatrixs. For this reason, connect ion propert ies of connected block is studied in this paper. The adjacency concept of connected block ment ioned here is used to do the classified judgement of H submat rix es, thus solving the format ion of a pair M submat rix in various cases. Decomposing method in pair of g raph- realizat ion is also presented. The method has both adv antag es of Mayeda’s method and more adaptable, practicable, convenient and effect ive.

References:

1 [ 美] 陈惠开.网论——网络流.吴哲辉, 刘昌孝译.北京: 人民邮电出版社, 1992
2 Mayeda W. 图论. 葛真译.贵州: 贵州人民出版社, 1985
3 Demetr iou P, Wing O1 Partitioning a matrix by inspection1 IEEE Trans on Circuit Theory, 1964,CT 11( 5) : 162

Memo

Memo:
-
Last Update: 2013-03-29