메뉴 건너뛰기
Networks
Volumn 31, Issue 4, 1998, Pages 217-225
Uniformly optimally reliable graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0041173683     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199807)31:4<217::AID-NET2>3.0.CO;2-G     Document Type: Article
Times cited : (25)
References (5)
  • 1
    • 84986938801 scopus 로고
    • On the existence of uniformly most reliable networks
    • Boesch, Li, and Suffel, On the existence of uniformly most reliable networks. Networks 21 (1991) 181-194.
    • (1991) Networks , vol.21 , pp. 181-194
    • Boesch1    Li2    Suffel3
  • 2
    • 0010944217 scopus 로고
    • Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimization design theory
    • C. Cheng, Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimization design theory. J. Combin. Theory 31 (1981) 240-248.
    • (1981) J. Combin. Theory , vol.31 , pp. 240-248
    • Cheng, C.1
  • 3
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading, MA
    • F. Harary, Graph Theory. Addison-Wesley, Reading, MA (1971).
    • (1971) Graph Theory
    • Harary, F.1
  • 4
    • 0040548676 scopus 로고
    • The analysis of redundancy networks
    • F. Moskowitz, The analysis of redundancy networks. AIEE Trans. Comm. Electron. 39 (1958) 627-632.
    • (1958) AIEE Trans. Comm. Electron , vol.39 , pp. 627-632
    • Moskowitz, F.1
  • 5
    • 84902441157 scopus 로고
    • A proof of Boesch's conjecture
    • G. Wang, A proof of Boesch's conjecture. Networks 24 (1994) 277-284.
    • (1994) Networks , vol.24 , pp. 277-284
    • Wang, G.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.