On external activity and inversions in trees

DOI10.1016/0095-8956(82)90059-4zbMath0501.05027OpenAlexW2066790577MaRDI QIDQ1172066

Janet Simpson Beissinger

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90059-4

zbMATH Keywords

inversion numberexternally active edges

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (7)

Enumerative applications of a decomposition for graphs and digraphs ⋮ On the evaluation of the Tutte polynomial at the points \((1, -1)\) and \((2, -1)\) ⋮ Trees, parking functions, and standard monomials of skeleton ideals ⋮ \(G\)-parking functions and tree inversions ⋮ Trees, parking functions and factorizations of full cycles ⋮ Mahonian statistics on labeled forests ⋮ Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees

Cites Work

• Depth-first search as a combinatorial correspondence
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: On external activity and inversions in trees