On H-irregularity strength of graphs
DOI10.7151/DMGT.1980zbMATH Open1372.05185OpenAlexW2613560251MaRDI QIDQ2409796FDOQ2409796
Authors: Faraha Ashraf, Martin Bača, Marcela Lascsáková, 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
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- On graph irregularity strength
- On irregular total labellings
- Total edge irregularity strength of generalized prism
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
- The total edge-irregular strengths of the corona product of paths with some graphs
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- On a conjecture about edge irregular total labelings
- Total edge irregularity strength of trees
- 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
- Irregular Assignments of Trees and Forests
- On the Irregularity Strength of Dense Graphs
- Irregular total labellings of generalized Petersen graphs
Cited In (8)
- On cycle-irregularity strength of ladders and fan graphs
- On H-irregularity strengths of G-amalgamation of graphs
- On H-irregularity strength of cycles and diamond graphs
- On face irregular evaluations of plane graphs
- On total \(H\)-irregularity strength of the disjoint union of graphs
- Entire \(H\)-irregularity strength of plane graphs
- On -irregularity strength of ladders and fan graphs
- Distance irregularity strength of graphs with pendant vertices
This page was built for publication: On H-irregularity strength of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409796)
