Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Graphs with a large capacity


Author: M. Rosenfeld
Journal: Proc. Amer. Math. Soc. 26 (1970), 57-59
MSC: Primary 05.40
DOI: https://doi.org/10.1090/S0002-9939-1970-0265204-0
MathSciNet review: 0265204
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A constructive method for obtaining graphs with a relatively large capacity is given. The method uses products of graphs.


References [Enhancements On Off] (What's this?)

  • [1] F. Harary, On the group of the composition of two graphs, Duke Math. J. 26 (1959), 29-34. MR 22 #1523. MR 0110648 (22:1523)
  • [2] -, Graph theory, Addison-Wesley, Reading, Mass., 1969. MR 0256911 (41:1566)
  • [3] A. Ljubič, A remark on a problem of C. Berge, Sibirsk. Mat. Ž. 5 (1964), 961-962. (Russian) MR 29 #5238. MR 0167973 (29:5238)
  • [4] M. Rosenfeld, On a problem of C. E. Shannon in graph theory, Proc. Amer. Math. Soc. 18 (1967), 315-319. MR 34 #7405. MR 0207590 (34:7405)
  • [5] C. E. Shannon, The zero error capacity of a noisy channel, IRE Trans. Information Theory IT-2 (1956), 8-19. MR 19, 623. MR 0089131 (19:623b)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05.40

Retrieve articles in all journals with MSC: 05.40


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1970-0265204-0
Keywords: Graphs, independence number, capacity of graphs, composition, strong product
Article copyright: © Copyright 1970 American Mathematical Society

American Mathematical Society