Enumeration of bipartite graphs and bipartite blocks

zbMATH Open1300.05129arXiv1304.0139MaRDI QIDQ405245FDOQ405245

Authors: Andrew Gainer-Dewar, Ira M. Gessel 

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Using the theory of combinatorial species, we compute the cycle index for bipartite graphs, which we use to count unlabeled bipartite graphs and bipartite blocks.

Full work available at URL: https://arxiv.org/abs/1304.0139

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 530033
• Publication:3487415
• Enumeration of unlabelled bicolored graphs by degree parities
• Counting unlabeled bipartite graphs using Polya's theorem
• scientific article; zbMATH DE number 4095501

zbMATH Keywords

combinatorial speciescycle indexunlabeled bipartite graphs and blocks

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Group actions on combinatorial structures (05E18)

Cites Work

• Analytic combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Une théorie combinatoire des séries formelles
• On the number of bi-colored graphs
• Species over a finite field
• Enumeration of Bicolourable Graphs
• Title not available (Why is that?)
• Labeled Bipartite Blocks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of non-separable graphs
• Title not available (Why is that?)
• The enumeration of bipartite graphs

Cited In (13)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Split graphs: combinatorial species and asymptotics
• Regularity in weighted graphs a symmetric function approach
• Isomorphism classes of bipartite cycle permutation graphs
• Finding balance: split graphs and related classes
• Enumeration of point-determining graphs
• Title not available (Why is that?)
• Enumeration of labeled bi-block graphs
• On the size of two families of unlabeled bipartite graphs
• Enumeration of bipartite self-complementary graphs
• Enumerations, forbidden subgraph characterizations, and the split-decomposition
• Counting unlabeled bipartite graphs using Polya's theorem

This page was built for publication: Enumeration of bipartite graphs and bipartite blocks

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