메뉴 건너뛰기




Volumn 52, Issue 5, 2006, Pages 2172-2176

The Shannon capacity of a graph and the independence numbers of its powers

Author keywords

Graph powers; Shannon capacity

Indexed keywords

CHANNEL CAPACITY; GRAPH THEORY; NUMBER THEORY; POLYNOMIALS;

EID: 33646061628     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.872856     Document Type: Article
Times cited : (50)

References (12)
  • 1
    • 84938009281 scopus 로고
    • "The zero-error capacity of a noisy channel"
    • Sep
    • C. E. Shannon, "The zero-error capacity of a noisy channel," IRE Trans. Inf. Theory, vol. IT-2, no. 3, pp. 8-19, Sep. 1956.
    • (1956) IRE Trans. Inf. Theory , vol.IT-2 , Issue.3 , pp. 8-19
    • Shannon, C.E.1
  • 2
    • 0002675107 scopus 로고
    • "Explicit Ramsey graphs and orthonormal labelings"
    • N. Alon, "Explicit Ramsey graphs and orthonormal labelings," Electron. J. Comb., vol. 1, no. R12, 1994. 8pp.
    • (1994) Electron. J. Comb. , vol.1 , Issue.R12 , pp. 8
    • Alon, N.1
  • 3
    • 0032411859 scopus 로고    scopus 로고
    • "The Shannon capacity of a union"
    • N. Alon, "The Shannon capacity of a union," Combinatorica, vol. 18, pp. 301-310, 1998.
    • (1998) Combinatorica , vol.18 , pp. 301-310
    • Alon, N.1
  • 4
    • 0142200024 scopus 로고    scopus 로고
    • "A limit theorem for the Shannon capacities of odd cycles, I"
    • T. Bohman, "A limit theorem for the Shannon capacities of odd cycles, I.," Proc. Amer. Math. Soc., vol. 131, no. 11, pp. 3559-3569, 2003.
    • (2003) Proc. T. Bohman, Amer. Math. Soc. , vol.131 , Issue.11 , pp. 3559-3569
  • 5
    • 0037353792 scopus 로고    scopus 로고
    • "A nontrivial lower bound on the Shannon capacities of the complements of odd cycles"
    • Mar
    • T. Bohman and R. Holzman, "A nontrivial lower bound on the Shannon capacities of the complements of odd cycles," IEEE Trans. Inf. Theory, vol. 49, no. 3, pp. 721-722, Mar. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.3 , pp. 721-722
    • Bohman, T.1    Holzman, R.2
  • 6
    • 0013476852 scopus 로고
    • "An upper bound for the Shannon capacity of a graph"
    • ser. Colloquia Mathematica Societatis János Bolyai. Szeged, Hungary
    • W. Haemers, "An upper bound for the Shannon capacity of a graph," in Algebraic Methods in Graph Theory, ser. Colloquia Mathematica Societatis János Bolyai. Szeged, Hungary, 1978, vol. 25, pp. 267-272.
    • (1978) Algebraic Methods in Graph Theory , vol.25 , pp. 267-272
    • Haemers, W.1
  • 7
    • 0013515394 scopus 로고
    • "On some problems of Lovász concerning the Shannon capacity of a graph"
    • Mar
    • W. Haemers, "On some problems of Lovász concerning the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol. IT-25, no. 2, pp. 231-232, Mar. 1979.
    • (1979) IEEE Trans. Inf. Theory , vol.IT-25 , Issue.2 , pp. 231-232
    • Haemers, W.1
  • 8
    • 0018292109 scopus 로고
    • "On the Shannon capacity of a graph"
    • Jan
    • L. Lovász, "On the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol. IT-25, no. 1, pp. 1-7, Jan. 1979.
    • (1979) IEEE Trans. Inf. Theory , vol.IT-25 , Issue.1 , pp. 1-7
    • Lovász, L.1
  • 9
    • 0018492534 scopus 로고
    • "A comparison of the Delsarte and Lovász bounds"
    • Jul
    • A. Schrijver, "A comparison of the Delsarte and Lovász bounds," IEEE Trans. Inf. Theory, vol. IT-25, no. 4, pp. 425-429, Jul. 1979.
    • (1979) IEEE Trans. Inf. Theory , vol.IT-25 , Issue.4 , pp. 425-429
    • Schrijver, A.1
  • 11
    • 0029375605 scopus 로고
    • "Repeated communication and Ramsey graphs"
    • Sep
    • N. Alon and A. Orlitsky, "Repeated communication and Ramsey graphs," IEEE Trans. Inf. Theory, vol. 41, no. 5, pp. 1276-1289, Sep. 1995.
    • (1995) IEEE Trans. Inf. Theory , vol.41 , Issue.5 , pp. 1276-1289
    • Alon, N.1    Orlitsky, A.2


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