Enumeration of connected invariant graphs
type: Item
instance of: scholarly article
title: Enumeration of connected invariant graphs
zbMATH Open document ID: 0532.05036
DOI: 10.1016/0095-8956(83)90040-0
author: Edward A. Bender
author: E. Rodney Canfield
published in: Journal of Combinatorial Theory. Series B
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 3843785
zbMATH Keywords: edge reversal
zbMATH Keywords: permutation of colors
zbMATH Keywords: generating functions
zbMATH Keywords: asymptotic number of disconnected graphs
MaRDI profile type: Publication
full work available at URL: 0095-8956(83)90040-0
OpenAlex ID: W1995108233
cites work: An Asymptotic Expansion for the Coefficients of Some Formal Power Series
cites work: Q5620608
cites work: Q5613842
cites work: Color patterns that are invariant under a given permutation of the colors
cites work: The enumeration of bipartite graphs
cites work: Enumeration of self‐converse digraphs
cites work: Q5682013
cites work: Enumeration of graphs with signed points and lines
cites work: Q4186356
cites work: Q3912820
cites work: Q3344228
cites work: Q5616734
cites work: Mixed self-complementary and self-converse digraphs
cites work: Isographs and oriented isographs
cites work: Asymptotic formulas for the number of oriented graphs
cites work: A Relationship between Two Sequences Iii
cites work: Asymptotic Relations Between Enumerative Functions in Graph Theory
description: scientific article; zbMATH DE number 3843785