메뉴 건너뛰기
Discrete Mathematics
Volumn 260, Issue 1-3, 2003, Pages 239-248
Optimally super-edge-connected transitive graphs
Author keywords

Cayley graph; Optimally super edge connected; Transitive graph
Indexed keywords

EID: 0037421179     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(02)00675-1     Document Type: Article
Times cited : (57)
References (8)
  • 1
    • 84941474134 scopus 로고
    • Synthesis of reliable networks - A survey
    • F. Boesch, Synthesis of reliable networks - a survey, IEEE Trans. Reliab. 35 (1986) 240-246.
    • (1986) IEEE Trans. Reliab. , vol.35 , pp. 240-246
    • Boesch, F.1
  • 2
    • 0024281477 scopus 로고
    • On computing a conditional edge connectivity of a graph
    • A. Esfahanian, S. Hakimi, On computing a conditional edge connectivity of a graph, Inform. Process. Lett. 27 (1988) 195-199.
    • (1988) Inform. Process. Lett. , vol.27 , pp. 195-199
    • Esfahanian, A.1    Hakimi, S.2
  • 3
    • 0020827886 scopus 로고
    • Conditional connectivity
    • F. Harary, Conditional connectivity, Networks 13 (1983) 346-357.
    • (1983) Networks , vol.13 , pp. 346-357
    • Harary, F.1
  • 4
    • 0039992140 scopus 로고    scopus 로고
    • Reliability analysis of circulant graphs
    • Q.L. Li, Q. Li, Reliability analysis of circulant graphs, Networks 31 (1998) 61-65.
    • (1998) Networks , vol.31 , pp. 61-65
    • Li, Q.L.1    Li, Q.2
  • 5
    • 0033095304 scopus 로고    scopus 로고
    • Super-edge connectivity of connected edge transitive graphs
    • Q.L. Li, Q. Li, Super-edge connectivity of connected edge transitive graphs, Networks 33 (1999) 157-159.
    • (1999) Networks , vol.33 , pp. 157-159
    • Li, Q.L.1    Li, Q.2
  • 6
    • 0041355766 scopus 로고    scopus 로고
    • Almost all Cayley graphs have diameter 2
    • J. Meng, Q. Huang, Almost all Cayley graphs have diameter 2, Discrete Math. 178 (1998) 267-269.
    • (1998) Discrete Math. , vol.178 , pp. 267-269
    • Meng, J.1    Huang, Q.2
  • 7
    • 0039631182 scopus 로고    scopus 로고
    • Connectivity of Cayley graphs
    • D.Z. Du, D.F. Hsu (Eds.), Kluwer, Dordrecht
    • R. Tindell, Connectivity of Cayley graphs, in: D.Z. Du, D.F. Hsu (Eds.), Combinatorial Network Theory, Kluwer, Dordrecht, 1996, pp. 41-64.
    • (1996) Combinatorial Network Theory , pp. 41-64
    • Tindell, R.1
  • 8
    • 0002443025 scopus 로고
    • Connectivity of transitive graphs
    • M.E. Watkins, Connectivity of transitive graphs, J. Combin. Theory 8 (1970) 23-29.
    • (1970) J. Combin. Theory , vol.8 , pp. 23-29
    • Watkins, M.E.1

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