Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Combinatorics and Graph Theory: Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25–29, 1980 /
.
Bookmark this Record
Catalogue Record 44357
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 44357
.
Reviews
Catalogue Record 44357
.
British Library
Resolver for RSN-44357
Google Scholar
Resolver for RSN-44357
WorldCat
Resolver for RSN-44357
Catalogo Nazionale SBN
Resolver for RSN-44357
GoogleBooks
Resolver for RSN-44357
ICTP Library
Resolver for RSN-44357
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
511.6
Title
Combinatorics and Graph Theory ([EBook] :) : Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25–29, 1980 / / edited by Siddani Bhaskara Rao.
Added Personal Name
Rao, Siddani Bhaskara
editor.
Other name(s)
SpringerLink (Online service)
Publication
Berlin, Heidelberg : : Springer Berlin Heidelberg : : Imprint: Springer, , 1981.
Physical Details
X, 502 p. : online resource.
Series
Lecture Notes in Mathematics
0075-8434 ; ; 885
ISBN
9783540470373
Contents note
Diperfect 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.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/BFb0092249
Links to Related Works
Subject References:
Combinatorics
.
Mathematics
.
Authors:
Rao, Siddani Bhaskara
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Lecture Notes in Mathematics
.
Classification:
511.6
.
.
ISBD Display
Catalogue Record 44357
.
Tag Display
Catalogue Record 44357
.
Related Works
Catalogue Record 44357
.
Marc XML
Catalogue Record 44357
.
Add Title to Basket
Catalogue Record 44357
.
Catalogue Information 44357
Beginning of record
.
Catalogue Information 44357
Top of page
.
Download Title
Catalogue Record 44357
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
44357
1
44357
-
2
44357
-
3
44357
-
4
44357
-
5
44357
-
Quick Search
Search for