On H-irregularity strength of graphs
From MaRDI portal
Publication:2409796
DOI10.7151/dmgt.1980zbMath1372.05185OpenAlexW2613560251MaRDI QIDQ2409796
Marcela Lascsáková, Faraha Ashraf, Martin Bača, Andrea Semaničová-Feňovčíková
Publication date: 13 October 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1980
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Distance irregularity strength of graphs with pendant vertices, On H-irregularity strength of cycles and diamond graphs, On -irregularity strength of ladders and fan graphs, On total \(H\)-irregularity strength of the disjoint union of graphs, On cycle-irregularity strength of ladders and fan graphs, On H-irregularity strengths of G-amalgamation of graphs, On face irregular evaluations of plane graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Total edge irregularity strength of generalized prism
- Irregular total labellings of generalized Petersen graphs
- On irregular total labellings
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- Irregularity strength of trees
- Irregular labelings of circulant graphs
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- On edge irregular total labeling of categorical product of two cycles
- A New Upper Bound for the Irregularity Strength of Graphs
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
- Irregular Assignments of Trees and Forests
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- On graph irregularity strength
- On the Irregularity Strength of Dense Graphs
- On a conjecture about edge irregular total labelings
- Total edge irregularity strength of trees
