LEADER 04664nam 2200577 450 001 996466498303316 005 20220907134829.0 010 $a3-540-47037-9 024 7 $a10.1007/BFb0092249 035 $a(CKB)1000000000437918 035 $a(SSID)ssj0000321927 035 $a(PQKBManifestationID)12131920 035 $a(PQKBTitleCode)TC0000321927 035 $a(PQKBWorkID)10280311 035 $a(PQKB)10324007 035 $a(DE-He213)978-3-540-47037-3 035 $a(MiAaPQ)EBC5610564 035 $a(Au-PeEL)EBL5610564 035 $a(OCoLC)1078998109 035 $a(MiAaPQ)EBC6841870 035 $a(Au-PeEL)EBL6841870 035 $a(OCoLC)793078694 035 $a(PPN)155223135 035 $a(EXLCZ)991000000000437918 100 $a20220907d1981 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aCombinatorics and graph theory $eproceedings of the symposium held at the Indian Statistical Institute, Calcutta, February 25-29 1980 /$fedited by S. B. Rao 205 $a1st ed. 1981. 210 1$aBerlin ;$aHeidelberg :$cSpringer-Verlag,$d[1981] 210 4$dİ1981 215 $a1 online resource (X, 502 p.) 225 1 $aLecture Notes in Mathematics ;$vVolume 885 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-11151-4 327 $aDiperfect Graphs -- Some new problems and results in Graph Theory and other branches of Combinatorial Mathematics -- A form invariant multivariable polynomial representation of graphs -- Some combinatorial applications of the new linear programming algorithm -- In search of a complete invariant for graphs -- Affine triple systems -- Tables of two-graphs -- Designs, adjacency multigraphs and embeddings: A survey -- On the adjugate of a symmetrical balanced incomplete block design with ?=1 -- Characterization of potentially connected integer-pair sequences -- Construction and combinatorial properties of orthogonal arrays with variable number of symbols in rows -- Construction of group divisible rotatable designs -- Some path-length properties of graphs and digraphs -- 2-2 Perfect graphic degree sequences -- Characterization of forcibly outerplanar graphic sequences -- Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs -- Set-reconstruction of chain sizes in a class of finite topologies -- Characterization of forcibly bipartite self-complementary bipartitioned sequences -- A graph theoretical recurrence formula for computing the characteristic polynomial of a matrix -- A note concerning Acharya?s conjecture on a spectral measure of structural balance in a social system -- On permutation-generating strings and rosaries -- Enumeration of labelled digraphs and hypergraphs -- Analysis of a spanning tree enumeration algorithm -- Binding number, cycles and complete graphs -- A class of counterexamples to a conjecture on diameter critical graphs -- Reconstruction of a pair of connected graphs from their line-concatenations -- On domination related concepts in Graph Theory -- The local central limit theorem for Stirling numbers of the second kind and an estimate for bell numbers -- A family of hypo-hamiltonian generalized prisms -- Graphical cyclic permutation groups -- Orthogonal main effect plans with variable number of levels for factors -- On molecular and atomic matroids -- New inequalities for the parameters of an association scheme -- On the (4?3)-regular subgraph conjecture -- Enumeration of Latin rectangles via SDR?s -- Nearly line regular graphs and their reconstruction -- On reconstructing separable digraphs -- Degree sequences of cacti -- A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences -- Towards a theory of forcibly hereditary P-graphic sequences -- The minimal forbidden subgraphs for generalized line-graphs -- Spectral characterization of the line graph of K ? n -- Balanced arrays from association schemes and some related results -- Some further combinatorial and constructional aspects of generalized Youden designs -- Maximum degree among vertices of a non-Hamiltonian homogeneously traceable graph. 410 0$aLecture notes in mathematics (Springer-Verlag) ;$vVolume 885. 606 $aCombinatorial analysis$vCongresses 615 0$aCombinatorial analysis 676 $a511.6 702 $aRao$b S. B$g(Siddani Bhaskara),$f1945- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466498303316 996 $aCombinatorics and graph theory$979928 997 $aUNISA