Computing an irregularity strength of selected graphs

DOI10.1016/J.ENDM.2006.06.046MaRDI QIDQ3439427zbMATH OpenOpenAlexFDO

Authors Adam Meissner, Magdalena A. Niwińska, Krzysztof T. Zwierzyński

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.046

zbMATH Keywords

\(CP(FD)\)graphirregularity strength ofMozart systemOz programming language

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 22657
• A Tight Bound on the Irregularity Strength of Graphs
• The irregularity strength of circulant graphs
• scientific article; zbMATH DE number 4142086
• An iterative approach to graph irregularity strength

Cites work

• Computer science today. Recent trends and developments
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• Irregular Assignments of Trees and Forests
• Parallel Processing and Applied Mathematics
• Principles of Constraint Programming

Cited in

(5)

• Computation of irregularity indices of certain computer networks
• Computing the Strength of a Graph
• scientific article; zbMATH DE number 6999860 (Why is no real title available?)
• Algorithm for computing the total vertex irregularity strength of some cubic graphs
• Irregular total labellings of generalized Petersen graphs

Describes a project that uses

Uses Software

• Oz

This page was built for publication: Computing an irregularity strength of selected graphs

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