The number of labeled k-dimensional trees
From MaRDI portal
Publication:5563935
DOI10.1016/S0021-9800(69)80120-1zbMath0175.20904OpenAlexW2018959921MaRDI QIDQ5563935
Raymond E. Pippert, Lowell W. Beineke
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80120-1
Related Items
On the zero forcing number and spectral radius of graphs ⋮ Twin-width II: small classes ⋮ Efficient learning of Bayesian networks with bounded tree-width ⋮ An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Refined enumeration of vertices among all rooted ordered $d$-trees ⋮ Random enriched trees with applications to random graphs ⋮ Hypergraphs with no special cycles ⋮ Wiener indices of maximal \(k\)-degenerate graphs ⋮ Properties and characterizations of k ‐trees ⋮ Bell numbers and \(k\)-trees ⋮ A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs ⋮ Vector representations of graphs and distinguishing quantum product states with one-way LOCC ⋮ On maximum Estrada indices of \(k\)-trees ⋮ Limits of random tree-like discrete structures ⋮ A kind of conditional connectivity of transposition networks generated by \(k\)-trees ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ Shape Measures of Random Increasing k-trees ⋮ Relating the annihilation number and the total domination number for some graphs ⋮ Multidimensional bipartite trees ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Unnamed Item ⋮ Sharp bounds of the Zagreb indices of \(k\)-trees ⋮ On the complexity of the black-and-white coloring problem on some classes of perfect graphs ⋮ Domination polynomials of \(k\)-tree related graphs ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Counting unlabeled \(k\)-trees ⋮ Multiplicative Zagreb indices of \(k\)-trees ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ On \((k+1)\)-line graphs of \(k\)-trees and their nullities ⋮ A coding algorithm for Rényi trees ⋮ The specification of 2-trees ⋮ Bijective linear time coding and decoding for \(k\)-trees ⋮ Independence polynomials of \(k\)-tree related graphs ⋮ Cayley's formula for multidimensional trees ⋮ Unnamed Item ⋮ Linearly many faults in 2-tree-generated networks ⋮ On the number of labeled graphs of bounded treewidth ⋮ On maximum signless Laplacian Estrada indices of \(k\)-trees ⋮ MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS ⋮ Disjoint independent dominating sets in graphs ⋮ Domination polynomial of clique cover product of graphs ⋮ Bijections on \(r\)-Shi and \(r\)-Catalan arrangements ⋮ Hamiltonian connectivity of 2-tree-generated networks ⋮ Higher-dimensional tree structures. I ⋮ The number of labeled dissections of a k-ball ⋮ Enumerating k-trees ⋮ Graph limits of random unlabelled k-trees ⋮ Graph limits of random graphs from a subset of connected k‐trees ⋮ Enumeration of labelled \((k,m)\)-trees ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Ancestors and descendants in evolving k‐tree models ⋮ Enumeration of solid 2-trees according to edge number and edge degree distribution ⋮ On some relations between 2-trees and tree metrics ⋮ Properties of (0,1)-matrices with no triangles ⋮ Enumeration of maximum acyclic hypergraphs ⋮ Unnamed Item ⋮ Counting acyclic hypergraphs
