On vertex and edge H-irregularity strengths of graphs
From MaRDI portal
Publication:5298356
DOI10.1142/S1793830916500701zbMath1351.05194MaRDI QIDQ5298356
Andrea Semaničová-Feňovčíková, Zuzana Kimáková, Faraha Ashraf, Martin Bača
Publication date: 14 December 2016
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
edge \(H\)-irregularity strengthedge \(H\)-irregular labelingvertex \(H\)-irregular labelingvertex \(H\)-irregularity strength
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
On H-irregularity strength of cycles and diamond graphs, On -irregularity strength of ladders and fan graphs, On cycle-irregularity strength of ladders and fan graphs, On edge \(H\)-irregularity strengths of some graphs, On H-irregularity strengths of G-amalgamation of graphs, On face irregular evaluations of plane graphs
Cites Work
- Unnamed Item
- On edge irregularity strength of graphs
- Irregularity strength of regular graphs
- A dynamic survey of graph labeling
- Irregularity strength of trees
- A New Upper Bound for the Irregularity Strength of Graphs
- Irregular Assignments of Trees and Forests
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
