Enumeration and Representation of Nonisomorphic Bipartite Graphs

DOI10.1016/S0167-5060(08)70716-7MaRDI QIDQ3889087zbMATH OpenOpenAlexFDO

Authors Subir Ghosh, Jagdish N. Srivastava

Publication date 1980

Published in Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70716-7

zbMATH Keywords

Polya's theoremBurnside's lemmarepresentation of orbits

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cited in

(4)

• Optimum designs under experimental constraints for a covariate model and an intra-class regression model
• Enumeration of connected graphs with cut vertices
• An infinite series of resolution III.2 designs for the \(2^ m\) factorial experiment
• Enumeration of unlabelled bicolored graphs by degree parities

This page was built for publication: Enumeration and Representation of Nonisomorphic Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3889087)