Skip to main content
SpringerLink
Log in

Combinatorics and Graph Theory

Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25-29, 1980

  • Conference proceedings
  • © 1981

Overview

Editors:
  1. Siddani Bhaskara Rao
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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 book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (45 papers)

  1. Front Matter

    Pages N2-VII
    Download chapter PDF

  2. Diperfect Graphs

    • Claude Berge
    Pages 1-8

  3. Some new problems and results in Graph Theory and other branches of Combinatorial Mathematics

    • Paul Erdös
    Pages 9-17

  4. A form invariant multivariable polynomial representation of graphs

    • E. V. Krishnamurthy
    Pages 18-32

  5. Some combinatorial applications of the new linear programming algorithm

    • L. Lovasz, A. Schriver
    Pages 33-41

  6. In search of a complete invariant for graphs

    • K. Balasubramanian, K. R. Parthasarathy
    Pages 42-59

  7. Affine triple systems

    • Dijen K. Ray-Chaudhuri
    Pages 60-69

  8. Tables of two-graphs

    • F. C. Bussemaker, R. A. Mathon, J. J. Seidel
    Pages 70-112

  9. Designs, adjacency multigraphs and embeddings: A survey

    • S. S. Shrikhande, N. M. Singhi
    Pages 113-132

  10. On the adjugate of a symmetrical balanced incomplete block design with λ=1

    • G. A. Patwardhan, M. N. Vartak
    Pages 133-152

  11. Characterization of potentially connected integer-pair sequences

    • Nirmala Achuthan
    Pages 153-164

  12. Construction and combinatorial properties of orthogonal arrays with variable number of symbols in rows

    • Basudeb Adhikary, Premadhis Das
    Pages 165-170

  13. Construction of group divisible rotatable designs

    • Basudeb Adhikary, Rajendranath Panda
    Pages 171-184

  14. Some path-length properties of graphs and digraphs

    • W. G. Bridges
    Pages 185-194

  15. 2-2 Perfect graphic degree sequences

    • P. D. Chawathe
    Pages 195-202

  16. Characterization of forcibly outerplanar graphic sequences

    • S. A. Choudum
    Pages 203-211

  17. Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs

    • Prabir Das
    Pages 212-226

  18. Set-reconstruction of chain sizes in a class of finite topologies

    • Shawpawn Das Kumar
    Pages 227-236

  19. Characterization of forcibly bipartite self-complementary bipartitioned sequences

    • T. Gangopadhyay
    Pages 237-260

  20. A graph theoretical recurrence formula for computing the characteristic polynomial of a matrix

    • M. K. Gill
    Pages 261-265
Back to top

Keywords

Bibliographic Information

  • Book Title: Combinatorics and Graph Theory

  • Book Subtitle: Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25-29, 1980

  • Editors: Siddani Bhaskara Rao

  • Series Title: Lecture Notes in Mathematics

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-11151-1Published: 01 October 1981

  • eBook ISBN: 978-3-540-47037-3Published: 14 November 2006

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: X, 502

  • Topics: Combinatorics

Publish with us

Policies and ethics

Back to top

Search

Navigation