The number of dissimilar supergraphs of a linear graph.
Frank Harary
Source: Pacific J. Math. Volume 7, Number 1
(1957), 903-911.
First Page:
Show
Hide
Primary Subjects:
05.0X
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.pjm/1103043670
Zentralblatt MATH identifier: 0078.16505
Mathematical Reviews number (MathSciNet): MR0087623
References
[1] R. L. Davis, The number of structures of finite relations, Proc. Amer. Math. Soc, 4 (1953), 486-495.
Mathematical Reviews (MathSciNet): MR14:1053g
Zentralblatt MATH: 0051.24702
[2] F. Harary, The number of linear, directed, rooted, and connected graphs, Trans. Amer. Math. Soc, 78 (1955), 445-463.
Mathematical Reviews (MathSciNet): MR16:844b
Zentralblatt MATH: 0065.16702
[3] F. Harary, The number of dissimilar line-subgraphs of a given graph, Pacific, J. Math. 6 (1956), 57-64.
Mathematical Reviews (MathSciNet): MR18:56i
Zentralblatt MATH: 0071.17604
[4] F. Harary and R.Z. Norman, The dissimilarity characteristic of linear graphs, Proc. Amer. Math. Soc, 5 (1954), 131-135.
Mathematical Reviews (MathSciNet): MR15:546c
Zentralblatt MATH: 0055.17201
[5] D. Knig, Theorie der endlichen und unendlichen Graphen, Leipzig, 1936; reprinted New York, 1950.
Zentralblatt MATH: JFM 62.0654.05
[6] R.Z. Norman, On the number of linear graphs with given blocks, Doctoral disserta- tion, University of Michigan, 1954 (in process of publication).
[7] G. Plya, Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen, und chemis- cie Verbindungen, Acta Math. 68 (1937), 145-254.
[8] D. Slepian, On the number of symmetry types of Boolean functionsof n variables, Can. J. Math. 5 (1953), 185-193.
Mathematical Reviews (MathSciNet): MR15:93f
Zentralblatt MATH: 0051.24802
Pacific Journal of Mathematics
