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

DOI10.2307/1993073zbMath0065.16702MaRDI QIDQ5849404

Frank Harary

Publication date: 1955

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

zbMATH Keywords

topology

Related Items

Plethystic Exponential Calculus and Characteristic Polynomials of Permutations, Unnamed Item, Numerical Algorithm for Pólya Enumeration Theorem, Unnamed Item, Enumeration of self‐converse digraphs, On acyclic simplicial complexes, On the number of balanced signed graphs, Note on Finite Topological Spaces, The enumeration of tree-like polyhexes, Enumeration of Mixed Graphs, 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, 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

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