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 Free Access
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.
- Frank Harary, On the group of the composition of two graphs, Duke Math. J. 26 (1959), 29–34. MR 110648
- Frank Harary, Graph theory, Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.-London, 1969. MR 0256911
- Ju. I. Ljubič, A remark on a problem of C. Berge, Sibirsk. Mat. Ž. 5 (1964), 961–962 (Russian). MR 0167973
- M. Rosenfeld, On a problem of C. E. Shannon in graph theory, Proc. Amer. Math. Soc. 18 (1967), 315–319. MR 207590, DOI https://doi.org/10.1090/S0002-9939-1967-0207590-3
- Claude E. Shannon, The zero error capacity of a noisy channel, Institute of Radio Engineers Transactions on Information Theory IT-2 (1956), no. September, 8–19. MR 89131, DOI https://doi.org/10.1109/tit.1956.1056798
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05.40
Retrieve articles in all journals with MSC: 05.40
Additional Information
Keywords:
Graphs,
independence number,
capacity of graphs,
composition,
strong product
Article copyright:
© Copyright 1970
American Mathematical Society