The Number of Linear, Directed, Rooted, and Connected Graphs

DOI10.2307/1993073MaRDI QIDQ5849404zbMATH OpenOpenAlexFDO

Authors Frank Harary

Publication date 1955

Full work available at URL https://doi.org/10.2307/1993073

zbMATH Keywords

topology

Cites work

• scientific article; zbMATH DE number 3060434 (Why is no real title available?)
• On the Number of Husimi Trees
• The dissimilarity characteristic of Husimi trees
• The Dissimilarity Characteristic of Linear Graphs
• The enumeration of graphs in the Feynman-Dyson technique
• The Number of Feynman Diagrams
• The Number of Structures of Finite Relations
• The number of trees

Cited in

(37)

• Une famille de polynômes ayant plusieurs propriétés enumeratives
• Enumeration of labelled multigraphs by degree parities
• An exact probability distribution on the connectivity of random graphs
• Algorithm for generating graphs of a given partition
• Enumeration of self-complementary structures
• A generalization of Burnside's combinatorial lemma
• The enumeration of self-complementary \(k\)-multigraphs
• Enumerating graphs via even/odd dichotomy
• On the number of phenotype structures in genetic systems
• Self-converse mixed graphs are extremely rare
• The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
• Tripartite graphs with given degree set
• Some structural theorems for partial difference operators
• Kombinatorische Anzahlbestimmungen in Relationen
• The Möbius function and connected graphs
• Graphs on unlabelled nodes with a given number of edges
• The number of strongly connected directed graphs
• On the number of \(n\)-plexes
• A note on 'pattern variants on a square field'
• A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences
• Counting balanced signed graphs using marked graphs
• Plethystic Exponential Calculus and Characteristic Polynomials of Permutations
• Betweenness centrality in convex amalgamation of graphs
• Numerical algorithm for Pólya enumeration theorem
• Enumeration of Mixed Graphs
• Enumeration of self‐converse digraphs
• On acyclic simplicial complexes
• On the number of balanced signed graphs
• Note on Finite Topological Spaces
• scientific article; zbMATH DE number 3292655 (Why is no real title available?)
• The enumeration of tree-like polyhexes
• The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges
• Enumeration of hypergraphs
• The numbers of labeled colored and chromatic trees
• The number of homeomorphically irreducible trees, and other species
• The number of functional digraphs
• Sets with involutions: power group enumeration

This page was built for publication: The Number of Linear, Directed, Rooted, and Connected Graphs

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