Some easily derivable integer sequences

Journal of Integer Sequences

Volumn 3, Issue 2, 2000, Pages

  Liskovets, Valery A ^a  

^a INSTITUTE OF MATHEMATICS   (Belarus)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; GRAPH THEORY; MAPS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; NUMERICAL ANALYSIS;

INTERPRETATION; LOOPS GRAPHS; SYMMETRIC GROUPS;

INTEGRAL EQUATIONS;

EID: 1342297370     PISSN: 15307638     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. B.Bagchi and B.Datta, A structure theorem for pseudomanifolds, Diacr. Math., 188 (1998), 41-60.
2. D. Bar-Natan, On the Vassiliev knot invariants, Topology, 34 (1995), 423-472.
3. E. A. Bender and E. R. Can eld, Enumeration of connected invariant graphs, J. Combin. Th., B34 (1983), 268-278.
4. M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. & Its Appl., 226-228 (1995), 57-72.
5. P. J.Cameron, Some sequences of integers, Discr. Math., 75 (1989), 89-102.
6. R. Frucht and F. Harary, Self-complementary generalized orbits of a permutation group, Canad. Math. Bull, 17 (1974), 203-208.
7. F. Harary, E. M. Palmer, Graphical Enumeration, Acad.Press, N.Y. (1973).
8. D.E.Knuth. Axioms and Hulls. Lect. Notes Comput. Sci., 806, Springer-Verlag, Berlin (1992).
9. L. M. Koganov, V. A. Liskovets and T. R. S. Walsh, Total vertex enumeration in rooted planar maps, Ars Combin. 54 (2000), 149-160.
10. V. A. Liskovets, On the number of Eulerian digraphs and homogeneous tournaments, Vesci AN BSSR (ser. z.-mat. n.), No 1 (1971), 22-27 (in Russian).
11. V. A. Liskovets, A contribution to the enumeration of strongly connected digraphs, Dokl. AN BSSR, 17, No 12 (1973), 1077-1080 (in Russian).
12. V. A. Liskovets, On a general enumerative scheme for labeled graphs, Dokl. AN BSSR, 21, No 6 (1977), 496-499 (in Russian).
13. V. A. Liskovets, Enumeration of nonisomorphic planar maps, Selecta Math. Soviet., 4 (1985), 304-323.
14. E. M. Palmer and R. W. Robinson, Enumeration of self-dual con gurations, Pacif. J. Math., 110 (1984), 203-221.
15. J.Propp, Problem #10620, Amer. Math. Monthly, 104 (1997), 870.
16. S. J. Quinn, Factorisation of complete bipartite graphs into two isomorphic subgraphs, Combinatorial Mathematics 77 (A. Horadamand W. D. Walliseds.), Lect. Notes in Math., 748, Springer, Berlin (1979), 98-111.
17. R. W. Robinson, Counting graphs with a duality property, Combinatorics (Proc. 8th Brit. Comb. Conf., Swansea, 1981), Land. Math. Soc. Lect. Notes Ser., 52 (1981), 156-186.
18. N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, published. electronically at http://www.research.att.corn/njas/sequences/
19. N. J. A. Sloane, Help File for Superseeker, a sub-page of [1.8] (1999).
20. N. J. A. Sloane, Transformations of Integer Sequences, a sub-page of [18] (2001).
21. N. J. A. Sloane and S. Plou e, The Encyclopedia of Integer Sequences, Academic Press, San Diego (1995).
22. Solution of problem #6673, Amer. Math. Monthly, 101 (1994), 686-687.
23. Solution of problem #10285, Amer. Math. Monthly, 103 (1996), 268-269.
24. Solution of problem #10620, Amer. Math. Monthly 106 (1999), 865-867.
25. A. Stoimenow, On the number of chord diagrams, Discr. Math. 218 (2000), 209-233.
26. E. M. Wright, The number of strong digraphs, Bull. London Math. Soc., 3 (1971), 348-350.