On H-irregularity strength of cycles and diamond graphs
From MaRDI portal
Publication:5101884
DOI10.1142/S1793830921501573zbMath1493.05249OpenAlexW3184022260MaRDI QIDQ5101884
Isma Bouchemakh, Andrea Semaničová-Feňovčíková, Hayat Labane
Publication date: 2 September 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501573
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total edge irregularity strength of generalized prism
- Total edge irregularity strength of disjoint union of wheel graphs
- Irregular total labellings of generalized Petersen graphs
- On the total vertex irregularity strength of trees
- On irregular total labellings
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- On total edge irregularity strength of centralized uniform theta graphs
- On irregularity strength of diamond network
- Irregular labelings of circulant graphs
- On total \(H\)-irregularity strength of the disjoint union of graphs
- On H-irregularity strength of graphs
- On edge irregular total labeling of categorical product of two cycles
- On the total edge irregularity strength of generalized helm
- Total vertex irregularity strength of disjoint union of Helm graphs
- On cycle-irregularity strength of ladders and fan graphs
- On H-irregularity strengths of G-amalgamation of graphs
- Total edge irregularity strength of ladder-related graphs
- On -irregularity strength of ladders and fan graphs
- On vertex and edge H-irregularity strengths of graphs
- On a conjecture about edge irregular total labelings
- Total edge irregularity strength of trees
This page was built for publication: On H-irregularity strength of cycles and diamond graphs
