Ebook: Combinatorics and Graph Theory: Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25–29, 1980

---

Content:
Front Matter....Pages -
Diperfect Graphs....Pages 1-8
Some new problems and results in Graph Theory and other branches of Combinatorial Mathematics....Pages 9-17
A form invariant multivariable polynomial representation of graphs....Pages 18-32
Some combinatorial applications of the new linear programming algorithm....Pages 33-41
In search of a complete invariant for graphs....Pages 42-59
Affine triple systems....Pages 60-69
Tables of two-graphs....Pages 70-112
Designs, adjacency multigraphs and embeddings: A survey....Pages 113-132
On the adjugate of a symmetrical balanced incomplete block design with ?=1....Pages 133-152
Characterization of potentially connected integer-pair sequences....Pages 153-164
Construction and combinatorial properties of orthogonal arrays with variable number of symbols in rows....Pages 165-170
Construction of group divisible rotatable designs....Pages 171-184
Some path-length properties of graphs and digraphs....Pages 185-194
2-2 Perfect graphic degree sequences....Pages 195-202
Characterization of forcibly outerplanar graphic sequences....Pages 203-211
Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs....Pages 212-226
Set-reconstruction of chain sizes in a class of finite topologies....Pages 227-236
Characterization of forcibly bipartite self-complementary bipartitioned sequences....Pages 237-260
A graph theoretical recurrence formula for computing the characteristic polynomial of a matrix....Pages 261-265
A note concerning Acharya’s conjecture on a spectral measure of structural balance in a social system....Pages 266-271
On permutation-generating strings and rosaries....Pages 272-275
Enumeration of labelled digraphs and hypergraphs....Pages 276-283
Analysis of a spanning tree enumeration algorithm....Pages 284-289
Binding number, cycles and complete graphs....Pages 290-296
A class of counterexamples to a conjecture on diameter critical graphs....Pages 297-300
Reconstruction of a pair of connected graphs from their line-concatenations....Pages 301-307
On domination related concepts in Graph Theory....Pages 308-320
The local central limit theorem for Stirling numbers of the second kind and an estimate for bell numbers....Pages 321-330
A family of hypo-hamiltonian generalized prisms....Pages 331-338
Graphical cyclic permutation groups....Pages 339-346
Orthogonal main effect plans with variable number of levels for factors....Pages 347-357
On molecular and atomic matroids....Pages 358-364
New inequalities for the parameters of an association scheme....Pages 365-367
On the (4–3)-regular subgraph conjecture....Pages 368-379
Enumeration of Latin rectangles via SDR’s....Pages 380-390
Nearly line regular graphs and their reconstruction....Pages 391-405
On reconstructing separable digraphs....Pages 406-409
Degree sequences of cacti....Pages 410-416
A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences....Pages 417-440
Towards a theory of forcibly hereditary P-graphic sequences....Pages 441-458
The minimal forbidden subgraphs for generalized line-graphs....Pages 459-472
Balanced arrays from association schemes and some related results....Pages 473-480
Some further combinatorial and constructional aspects of generalized Youden designs....Pages 481-487
Maximum degree among vertices of a non-Hamiltonian homogeneously traceable graph....Pages 488-495
....Pages 496-500