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

DOI10.2307/1993073zbMath0065.16702OpenAlexW4245888957MaRDI QIDQ5849404

Frank Harary

Publication date: 1955

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

zbMATH Keywords

topology

Related Items (37)

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

Cites Work

• Unnamed Item
• The number of trees
• The dissimilarity characteristic of Husimi trees
• The enumeration of graphs in the Feynman-Dyson technique
• The Number of Structures of Finite Relations
• On the Number of Husimi Trees
• The Number of Feynman Diagrams
• The Dissimilarity Characteristic of Linear Graphs

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