-labeling number of trees

DOI10.1016/J.DISC.2006.06.016zbMATH Open1106.05085OpenAlexW2051902598MaRDI QIDQ856879FDOQ856879

Authors: Chin-Lin Shiue, Hung-Lin Fu 

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.016

Recommendations

• On γ-labelings of trees
• \(\alpha \)-labelings and the structure of trees with nonzero \(\alpha \)-deficit
• A formula for the number of labelled trees
• On the number of \(\alpha\)-labeled graphs
• The \(L(2,1)\)-labelling of trees
• A REFINED ENUMERATION OF p-ARY LABELED TREES
• Enumeration of labelled \((k,m)\)-trees
• scientific article; zbMATH DE number 971754
• A remark on the enumeration of rooted labeled trees
• Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees

zbMATH Keywords

graph decompositiontree decompositiongraceful labelings

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• New families of graphs that have \(\alpha\)-labelings
• Title not available (Why is that?)
• On the decomposition of n‐cubes into isomorphic trees
• Distinct Sums Modulo n and Tree Embeddings
• On the \(\alpha\)-labeling number of bipartite graphs
• Title not available (Why is that?)

Cited In (3)

• Bounds on the convex label number of trees
• On \(\alpha\)-labellings of lobsters and trees with a perfect matching
• Trees which admit no \(\alpha \)-labelings.

This page was built for publication: \(\alpha\)-labeling number of trees

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