Enumeration and Representation of Nonisomorphic Bipartite Graphs

DOI10.1016/S0167-5060(08)70716-7zbMath0445.05054OpenAlexW949796235MaRDI QIDQ3889087

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

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

Related Items (4)

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

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