scientific article; zbMATH DE number 139927

MaRDI QIDQ4028274zbMATH OpenFDO

Authors L. A. Cammack, R. H. Schelp, G. C. Schrag

Publication date 28 March 1993

zbMATH Keywords

treeconjectureirregularity strengthpendant verticesfull \(d\)-ary tree

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• On the irregularity strength of trees
• Publication:4504897
• On total vertex-irregular labellings for several types of trees
• Total vertex irregularity strength of trees with maximum degree five
• Irregular Assignments of Trees and Forests

Cited in

(10)

• Edge irregular total labellings for graphs of linear size
• The irregular coloring number of a tree
• Total vertex irregularity strength of trees with maximum degree five
• On the irregularity strength of them ×n grid
• On the total vertex irregularity strength of trees
• On the number of irregular assignments on a graph
• On the irregularity strength of trees
• Irregularity strength of trees
• An iterative approach to graph irregularity strength
• scientific article; zbMATH DE number 6311155 (Why is no real title available?)

This page was built for publication:

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