On the number of distinct orderings of a vertex-labelled graph when rooted on different vertices

DOI10.1016/0095-8956(71)90025-6zbMath0206.52702OpenAlexW1964720482MaRDI QIDQ2542962

Yanyan Li

Publication date: 1971

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(71)90025-6

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Graph theory and molecular distribution. I: copolycondensation of polyfunctional monomers bearing identical reactive groups ⋮ Coalescent random forests

Cites Work

• Unnamed Item

This page was built for publication: On the number of distinct orderings of a vertex-labelled graph when rooted on different vertices