DocumentCode
954624
Title
1-distinguishability of SEC graphs
Author
Srimani, Pradip K. ; Sinha, Bhabani P. ; Choudhury, Arun K.
Author_Institution
Statistical Institute, Calcutta, India
Volume
66
Issue
12
fYear
1978
Firstpage
1668
Lastpage
1669
Abstract
This letter describes a new scheme to determine the all minimal edge sets of a SEC graph under which the graph becomes 1- distinguishable. The problem has been treated within the framework of switching theory by showing its equivalence to the classical problem of prime implicant covering.
Keywords
Fault diagnosis; Monitoring; System testing;
fLanguage
English
Journal_Title
Proceedings of the IEEE
Publisher
ieee
ISSN
0018-9219
Type
jour
DOI
10.1109/PROC.1978.11183
Filename
1455452
Link To Document