Upper bounds on distance vertex irregularity strength of some families of graphs

DOI10.7494/OPMATH.2022.42.4.561MaRDI QIDQ5089899zbMATH OpenFDO

Authors Sylwia Cichacz, Agnieszka Görlich, Andrea Semaničová-Feňovčíková

Publication date 15 July 2022

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/OPMATH.2022.42.4.561

zbMATH Keywords

distance vertex irregularity strength of a graphhypercubetree

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Upper bounds on inclusive distance vertex irregularity strength
• A new upper bound for the total vertex irregularity strength of graphs
• On inclusive distance vertex irregular labelings
• 1-distant irregularity strength of graphs
• Distance irregularity strength of graphs with pendant vertices

Cites work

• Additive coloring of planar graphs
• Distance irregularity strength of graphs with pendant vertices
• Edge weights and vertex colours
• Group distance magic and antimagic hypercubes
• Handbook of product graphs
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 1998306 (Why is no real title available?)
• Lucky labelings of graphs
• On distance irregular labelings of cycles and wheels
• On distance irregular labelling of graphs
• On inclusive and non-inclusive vertex irregular d-distance vertex labelings
• On inclusive distance vertex irregular labelings
• Upper bounds on inclusive distance vertex irregularity strength

Cited in

(5)

• A new upper bound for the total vertex irregularity strength of graphs
• Upper bounds on inclusive distance vertex irregularity strength
• Distance irregularity strength of graphs with pendant vertices
• Sum-distinguishing number of sparse hypergraphs
• Introduction to majority additive coloring

This page was built for publication: Upper bounds on distance vertex irregularity strength of some families of graphs

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