Total edge irregularity strength of book graphs and double book graphs
Open Access
- 19 December 2019
- conference paper
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2192 (1) , 040013
Abstract
Let G(V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labeling is a map f : V ∪ E → {1, 2, …, k} such that for any two different edges xy and x’y’ in E, ω(xy) ≠ ω(x’y’) where ω(xy) = f(x) + f(y) + f(xy). The minimum k for which the graph G admits an edge irregular total k-labeling is called the total edge irregularity strength of G, denoted by tes(G). In this paper, we show the exact value of the total edge irregularity strength of any book graph of m sides and n sheets Bn(Cm) and of any double book graph of m sides and 2n sheets 2Bn(Cm).Keywords
This publication has 11 references indexed in Scilit:
- Total edge irregularity strength of ladder-related graphsAsian-European Journal of Mathematics, 2018
- The Total Edge Irregularity Strength of Uniform Theta GraphsJournal of Physics: Conference Series, 2018
- On total edge irregularity strength of centralized uniform theta graphsAKCE International Journal of Graphs and Combinatorics, 2018
- Irregular labelings of helm and sun graphsAKCE International Journal of Graphs and Combinatorics, 2015
- A Survey of Irregularity StrengthElectronic Notes in Discrete Mathematics, 2015
- Total Edge Irregularity Strength of Disjoint Union of Wheel GraphsElectronic Notes in Discrete Mathematics, 2015
- On Total Edge Irregularity Strength of Generalized Web Graphs and Related GraphsMathematics in Computer Science, 2015
- Total edge irregularity strength of generalized prismApplied Mathematics and Computation, 2014
- On irregular total labellingsDiscrete Mathematics, 2007
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite GraphsElectronic Notes in Discrete Mathematics, 2007