scientific article; zbMATH DE number 15351

zbMATH Open0752.05034MaRDI QIDQ3971995FDOQ3971995

Authors: Martin Aigner, Eberhard Triesch 

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Irregular Assignments of Trees and Forests
• Irregularity strength of dense graphs
• Publication:3474670
• A new upper bound for the irregularity strength of graphs
• On the number of irregular assignments on a graph

zbMATH Keywords

weightingirregular assignment

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited In (10)

• On the total detection numbers of complete bipartite graphs
• The irregular coloring number of a tree
• A note on the total detection numbers of cycles
• Codings of graphs with binary edge labels
• On the number of irregular assignments on a graph
• Vertex-distinguishing edge-colorings of 2-regular graphs
• Binary labeling of graphs
• A smallest irregular oriented graph containing a given diregular one
• Distant total sum distinguishing index of graphs
• Title not available (Why is that?)

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 Q3971995)