Pages that link to "Item:Q5563935"
From MaRDI portal
The following pages link to The number of labeled k-dimensional trees (Q5563935):
Displaying 50 items.
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs (Q385733) (← links)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
- Matching preclusion and conditional matching preclusion for regular interconnection networks (Q442207) (← links)
- Domination polynomials of \(k\)-tree related graphs (Q471790) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Multiplicative Zagreb indices of \(k\)-trees (Q476319) (← links)
- On the signless Laplacian spectra of \(k\)-trees (Q477752) (← links)
- Hypergraphs with no special cycles (Q594899) (← links)
- The specification of 2-trees (Q696853) (← links)
- Higher-dimensional tree structures. I (Q759041) (← links)
- On maximum Estrada indices of \(k\)-trees (Q890574) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Independence polynomials of \(k\)-tree related graphs (Q972329) (← links)
- Hamiltonian connectivity of 2-tree-generated networks (Q1007659) (← links)
- Properties of (0,1)-matrices with no triangles (Q1054733) (← links)
- A coding algorithm for Rényi trees (Q1207762) (← links)
- Cayley's formula for multidimensional trees (Q1220079) (← links)
- Disjoint independent dominating sets in graphs (Q1240740) (← links)
- Enumeration of labelled \((k,m)\)-trees (Q1284483) (← links)
- Multidimensional bipartite trees (Q1415538) (← links)
- On some relations between 2-trees and tree metrics (Q1584450) (← links)
- Counting acyclic hypergraphs (Q1609631) (← links)
- Random enriched trees with applications to random graphs (Q1658748) (← links)
- A kind of conditional connectivity of transposition networks generated by \(k\)-trees (Q1701105) (← links)
- Enumeration of maximum acyclic hypergraphs (Q1862928) (← links)
- Bell numbers and \(k\)-trees (Q1923519) (← links)
- Bijections on \(r\)-Shi and \(r\)-Catalan arrangements (Q2040989) (← links)
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks (Q2077379) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC (Q2185850) (← links)
- Limits of random tree-like discrete structures (Q2192232) (← links)
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities (Q2229485) (← links)
- On maximum signless Laplacian Estrada indices of \(k\)-trees (Q2279989) (← links)
- Efficient learning of Bayesian networks with bounded tree-width (Q2374540) (← links)
- Sharp bounds of the Zagreb indices of \(k\)-trees (Q2444151) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Counting unlabeled \(k\)-trees (Q2452429) (← links)
- The number of labeled dissections of a k-ball (Q2543429) (← links)
- Enumerating k-trees (Q2546877) (← links)
- Enumeration of solid 2-trees according to edge number and edge degree distribution (Q2566279) (← links)
- Wiener indices of maximal \(k\)-degenerate graphs (Q2657107) (← links)
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
- Relating the annihilation number and the total domination number for some graphs (Q2696610) (← links)
- Linearly many faults in 2-tree-generated networks (Q3057135) (← links)
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS (Q3606558) (← links)
- (Q4561540) (← links)
- (Q4915354) (← links)
- Graph limits of random unlabelled <i>k</i>-trees (Q4987257) (← links)
- Twin-width II: small classes (Q5051371) (← links)
