Skip to main content
SpringerLink
Log in

Designs, adjacency multigraphs and embeddings: A survey

  • Special Invited Addresses
  • Conference paper
  • First Online:
Combinatorics and Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 885))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. W. Beineke, Derived graphs and digraphs, Beitrage Zur Graphentheorie (H. Sachs et al. (Eds.), Teubner, Leipzig, 1968, 17–33.

    Google Scholar 

  2. K. N. Bhattacharya, A new balanced incomplete block design, Science and Culture, 1944, 508.

    Google Scholar 

  3. R. C. Bose, Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math., 13 (1963), 389–419.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. C. Bose, Graphs and Designs, Finite Geometric Structures and their Applications, CIME advanced Summer Institute, 1972 Ed. A. Barlotti, Edizioni Cremonese, Roma 1973.

    Google Scholar 

  5. R. C. Bose, S. S. Shrikhande, Embedding the comolement of an oval in a projective plane of even order, Discrete Math., 1973.

    Google Scholar 

  6. R. C. Bose, S. S. Shrikhande, N. M. Singhi, Edge regular multigraphs and partial geometric designs with an application to the embedding of quasi-residual designs, Academia Nationale Dei Lincei, Atti del convegni Lincei, 17(1976), 49–81.

    MathSciNet  MATH  Google Scholar 

  7. R. C. Bose, W. G. Bridges, M. S. Shrikhande, Characterization of partial geometric designs, Discrete Math., 16(1976), 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  8. R. H. Bruck, Finite nets II. Uniqueness and imbedding, Pacific J. Math., 13(1963), 421–457.

    Article  MathSciNet  MATH  Google Scholar 

  9. P. J. Cameron, J. M. Goethals, J. J. seidel, E. E. Shult, Line graphs, root systems and elliptic geometry, J. of Alg., 43(1976), 305–327.

    Article  MathSciNet  MATH  Google Scholar 

  10. Li-Chien Chang, The uniqueness and non-uniqueness of triangular association schemes, Science Record, Math., New Sr. 3(1959), 604–613.

    MATH  Google Scholar 

  11. Li-Chien Chang, Association schemes of partially balanced designs with parameters v=28, n1=12, n2=15, and p 211 =4, Science Record, Math., New Sr. 4, 12–18.

    Google Scholar 

  12. W. S. Connor, On the structure of balanced incomplete block designs, Ann. Math. Stat., 29(1952), 57–71.

    Article  MathSciNet  MATH  Google Scholar 

  13. W. S. Connor, The uniqueness of the triangular association scheme, Ann. Math. Stat., 23(1958), 272–266.

    MathSciNet  MATH  Google Scholar 

  14. P. Dembowski, Finite Geometrics, Springer-Verlag, Berlin and New York, 1968.

    Book  MATH  Google Scholar 

  15. D. A. Drake, D. Jungnickel, Klingenberg structures and partial designs II, regularity and uniformity, Pacific J. Math., 77 (1978), 389–415.

    Article  MathSciNet  MATH  Google Scholar 

  16. M. Hall, Jr., W. S. Connor, An embedding theorem for balanced incomplete block designs, Canad. J. Math., 6(1953), 35–41.

    Article  MathSciNet  MATH  Google Scholar 

  17. H. Hanani, On transversal designs in Proceedings of advanced study Inst. on Combinatorics (Brukelen 1974), Part 1, Amsterdam, Mathematical Centre, 1974, 42–52.

    Google Scholar 

  18. F. Harary, Graph Theory, Addison-Wesley, Reading, 1972.

    MATH  Google Scholar 

  19. A. J. Hoffman, On the uniqueness of triangular association scheme, Ann. Math. Stat., 31(1960), 492–497.

    Article  MathSciNet  MATH  Google Scholar 

  20. A. J. Hoffman, On the exceptional case in a characterization of the arcs of complete graph, IBM J. Res. Develop., 4, 497–504.

    Google Scholar 

  21. A. J. Hoffman, Eigen values of graphs, studies in graph theory, Part II, ed. D. R. Fulkerson, M. A. A. 225–245.

    Google Scholar 

  22. A. J. Hoffman, \(- 1 - \sqrt 2 ?\) Combinatorial Structures and their Applications, Gordon and Breach, 1970, 173–176.

    Google Scholar 

  23. D. Jungnickel, On difference matrices, resolvable transversal designs and generalised Hadamard matrices, Math. Z., 167(1978), 49–60.

    Article  MathSciNet  MATH  Google Scholar 

  24. J. F. Lawless, Block intersections in quasi-residual designs, Aequationes Math., 5(1970), 40–46.

    Article  MathSciNet  MATH  Google Scholar 

  25. D. McCarthy, S. A. Vanstone, Embedding (r, l) designs in finite projective planes, Descrete Math., 19(1977), 67–76.

    Article  MathSciNet  MATH  Google Scholar 

  26. D. McCarthy, N. M. Singhi, S. Vanstone, A Graph-Theoretical Approach to Embedding (r, l)-Designs, Graph Theory and related Topics, Ed. J. A. Bondy and U.S.R. Murty, Academic Press, 1979.

    Google Scholar 

  27. R. C. Mullin, S. A. Vanstone, The approximation of SBIBD’s by regular pairwise balanced designs: case λ≥2.

    Google Scholar 

  28. R. C. Mullin, S. A. Vanstone, A generalization of theorem of Totten, J. Aust. Math. Soc., 22(1976), 494–500.

    Article  MathSciNet  MATH  Google Scholar 

  29. R. C. Mullin, N. M. Singhi, S. A. Vanstone, Embedding the affine complement of three intersection lines in a finite projective plane, J. Aust. Math. Soc., 24(series A) (1977), 458–464.

    Article  MathSciNet  MATH  Google Scholar 

  30. R. N. Naik, S. B. Rao, S. S. Shrikhande, N. M. Singhi, Intersection graphs of k-uniform linear hypergraphs, submitted for publication.

    Google Scholar 

  31. Ar. Neumaier, Quasi-residual 2-designs, 11/2-designs and strongly regular multigraphs (submitted for publication)

    Google Scholar 

  32. D. Raghava Rao, Constructions and Combinatorial Problems in Design of Experiments, John Wiley, 1971.

    Google Scholar 

  33. S. B. Rao, N. M. Singhi, K. S. Vijayan, Forbidden subgraphs for generalised line graphs (submitted for publication).

    Google Scholar 

  34. D. K. Ray-Chaudhuri, Uniqueness of association schemes, Academic National Dei Lincei, Atti del conveni Lencei, 17(1976), 465–479.

    MathSciNet  MATH  Google Scholar 

  35. D. K. Ray-Chaudhuri, Geometric incidence structures, Proc. 6th British Comb. Conf., 1977, 87–116.

    Google Scholar 

  36. S. S. Sane, A recursive construction of symmetric (s,r,μ)-nets (submitted for publication).

    Google Scholar 

  37. S. S. Shrikhande, On characterization of triangular association scheme, Ann. Math. Stat., 30(1959), 39–47.

    Article  MathSciNet  MATH  Google Scholar 

  38. S. S. Shrikhande, The uniqueness of the L2 association scheme, Ann. Math. Stat., 30(1959), 781–798.

    Article  MathSciNet  MATH  Google Scholar 

  39. S. S. Shrikhande, Relations between incomplete block designs, contributions to probability and statistics, Essays in honour of Harold Hotelling, Stanford U. Press, 1960, 388–395.

    Google Scholar 

  40. S. S. Shrikande, and Bhagwandas, A note on embedding for Hadamard matrices in Contributions to Statistics and Probability, Essays in memory of Samarendra Nath Roy, University of North Carolina Press, 1967.

    Google Scholar 

  41. S. S. Shrikhande, and Bhagwandas, On embedding of orthogonal arrays of strength two, combinatorial mathematics and its applications, University of North Carolina Press, 1969, 256–273.

    Google Scholar 

  42. S. S. Shrikhande, Affine resolvable balanced incomplete block designs: A survey, Aequationes Math., 14(1976), 251–269.

    Article  MathSciNet  MATH  Google Scholar 

  43. S. S. Shrikhande, N. M. Singhi, A note on embedding of orthogonal arrays of strength two, J. Statist. Planning inf., 3(1979), 267–271.

    Article  MathSciNet  MATH  Google Scholar 

  44. S. S. Shrikhande, N. M. Singhi, Embedding of orthogonal arrays of strength two and deficiency greater than two, J. Statist. Planning inf. (to appear).

    Google Scholar 

  45. N. M. Singhi, S. S. Shrikhande, Embedding of quasi-residual designs, Geometriac Dedicata, 2(1974), 509–517.

    MathSciNet  MATH  Google Scholar 

  46. N. M. Singhi, S. S. Shrikhande, Embedding of quasi-residual designs with λ=3, Utilitas Mathematica, 4(1973), 35–53.

    MathSciNet  MATH  Google Scholar 

  47. R. G. Stanton, Interconnections of related BIBD’s, J. Comb. Theory, 3(1969), 387–391.

    Article  MATH  Google Scholar 

  48. K. E. Wolf, Punktstrabile und Semipartial geometrische Inzidenzstrukturen, Mitt. Math. Sem, Giessen, 135(1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Flat No. 3, Pukhraj, South Ambajali Road Laxmi Nagar, Nagpur

    S. S. Shrikhande

  2. School of Mathematics, Tata Institute of Fundamental Research, Colaba, 400 005, Bombay

    N. M. Singhi

Authors
  1. S. S. Shrikhande
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. M. Singhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Siddani Bhaskara Rao

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Shrikhande, S.S., Singhi, N.M. (1981). Designs, adjacency multigraphs and embeddings: A survey. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092257

Download citation

  • DOI: https://doi.org/10.1007/BFb0092257

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation