Computing the irregularity strength of planar graphs
From MaRDI portal
Publication:1634487
DOI10.3390/MATH6090150zbMath1401.05263OpenAlexW2888926263WikidataQ129333048 ScholiaQ129333048MaRDI QIDQ1634487
Publication date: 18 December 2018
Published in: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/math6090150
planar graphtotal edge irregularity strengthtotal vertex irregularity strengthtotal irregularity strength
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (1)
Cites Work
- Total edge irregularity strength of generalized prism
- On the total vertex irregularity strength of trees
- On irregular total labellings
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- Irregular labelings of circulant graphs
- Total edge irregularity strength of accordion graphs
- On edge irregular total labeling of categorical product of two cycles
- On the total irregularity strength of some Cartesian product graphs
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
- Total edge irregularity strength of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing the irregularity strength of planar graphs