DocumentCode :
1421347
Title :
Edge-combination classes of complete graphs
Author :
Char, J.P.
Author_Institution :
Southern Railway, Stores Department, Madras, India
Volume :
117
Issue :
10
fYear :
1970
fDate :
10/1/1970 12:00:00 AM
Firstpage :
1941
Lastpage :
1946
Abstract :
A systematic method of generating different combinations of edges, taken m at a time, in complete graphs, and classification of these edge combinations based on their topological structure, are discussed. In the process, a simple algorithm is presented for determining whether or not two given sets of edges are topologically equivalent. The listing of edge-combination classes has a significant bearing on some problems of realisation. The procedures given are all simple and routine and are suitable for computerisation.
Keywords :
graph theory; subroutines; topology;
fLanguage :
English
Journal_Title :
Electrical Engineers, Proceedings of the Institution of
Publisher :
iet
ISSN :
0020-3270
Type :
jour
DOI :
10.1049/piee.1970.0342
Filename :
5249232
Link To Document :
بازگشت