Note on ``hook-length as a graph invariant of trees

DOI10.4310/JOC.2017.V8.N1.A8MaRDI QIDQ501992zbMATH OpenOpenAlexFDO

Authors Hua Wang

Publication date 10 January 2017

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2017.v8.n1.a8

zbMATH Keywords

Ferrers diagrams of integer partitions

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• On some degree-and-distance-based graph invariants of trees
• scientific article; zbMATH DE number 3904629
• Two tree-width-like graph invariants
• Two kinds of hook length formulas for complete \(m\)-ary trees
• scientific article; zbMATH DE number 4168708
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• A note on the arboricity of graphs
• On Postnikov's hook length formula for binary trees
• Extremal properties of distance-based graph invariants for \(k\)-trees.
• A unifying approach for proving hook-length formulas for weighted tree families

Cited in

(1)

• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

Describes a project that uses

Uses Software

• HookExp

This page was built for publication: Note on ``hook-length as a graph invariant of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501992)