Total irregularity strength of three families of graphs
From MaRDI portal
Publication:2516510
DOI10.1007/s11786-015-0229-xzbMath1317.05174OpenAlexW814506100MaRDI QIDQ2516510
A. N. M. Salman, Andrea Semaničová-Feňovčíková, R. Ramdani, Martin Bača, Hilda Assiyatun
Publication date: 3 August 2015
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-015-0229-x
Related Items (2)
Complete bipartite graph is a totally irregular total graph ⋮ Distant total irregularity strength of graphs via random vertex ordering
Cites Work
- Total edge irregularity strength of generalized prism
- 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
- A new upper bound for the total vertex irregularity strength of graphs
- Irregularity strength of the toroidal grid
- Total edge irregularity strength of toroidal fullerene
- 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
- On the irregularity strength of trees
- A Tight Bound on the Irregularity Strength of Graphs
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- On a conjecture about edge irregular total labelings
- Total Vertex Irregularity Strength of Dense 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: Total irregularity strength of three families of graphs
