000 | 04436nam a22004455i 4500 | ||
---|---|---|---|
001 | 978-3-540-47037-3 | ||
003 | DE-He213 | ||
005 | 20160624101825.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1981 gw | s |||| 0|eng d | ||
020 |
_a9783540470373 _9978-3-540-47037-3 |
||
024 | 7 |
_a10.1007/BFb0092249 _2doi |
|
050 | 4 | _aQA164-167.2 | |
072 | 7 |
_aPBV _2bicssc |
|
072 | 7 |
_aMAT036000 _2bisacsh |
|
082 | 0 | 4 |
_a511.6 _223 |
245 | 1 | 0 |
_aCombinatorics and Graph Theory _h[electronic resource] : _bProceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25–29, 1980 / _cedited by Siddani Bhaskara Rao. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1981. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1981. |
|
300 |
_aX, 502 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v885 |
|
505 | 0 | _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. | |
650 | 0 | _aMathematics. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aMathematics. |
650 | 2 | 4 | _aCombinatorics. |
700 | 1 |
_aRao, Siddani Bhaskara. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540111511 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v885 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0092249 |
942 |
_2EBK1505 _cEBK |
||
999 |
_c30799 _d30799 |