Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-total-edge-irregularity-strength-of-generalized-web-graphs-and-1esbYMfBHt
References (16)
-
A. Ahmad, M. Bača, Y. Bashir, M. Siddiqui (2012)
Total edge irregularity strength of strong product of two pathsArs Comb., 106
-
M. Bača, Marcela Lascsáková, M. Siddiqui (2013)
Total Edge Irregularity Strength of Toroidal FullereneMathematics in Computer Science, 7
-
W.D. Wallis (2001)
Magic Graphs -
A. Ahmad, M. Bača, M. Siddiqui (2013)
On Edge Irregular Total Labeling of Categorical Product of Two CyclesTheory of Computing Systems, 54
-
J. Miškuf, S. Jendroľ (2007)
On total edge irregularity strength of the gridsTatra Mt. Math. Publ., 36
-
(2012)
Irregular total labelings of generalized Petersen graphs -
D. Indriati, I. Wijayanti, K. Sugeng (2013)
On the total edge irregularity strength of generalized helmAKCE International Journal of Graphs and Combinatorics, 10
-
J. Ivanco, S. Jendrol’ (2006)
Total edge irregularity strength of treesDiscuss. Math. Graph Theory, 26
-
S. Hegde, Sudhakar Shetty (2003)
On magic graphsAustralas. J Comb., 27
-
S. Jendrol’, Jozef Miskuf, R. Soták (2007)
Total edge irregularity strength of complete graphs and complete bipartite graphsDiscret. Math., 310
-
S. Jendroľ, J. Miškuf, R. Soták (2007)
Total edge irregularity strength of complete and complete bipartite graphsElectron. Notes Discrete Math., 28
-
M. Bača, S. Jendroľ, M. Miller, J. Ryan (2007)
On irregular total labelingDiscrete Math., 307
-
M. Bača, M. Siddiqui (2014)
Total edge irregularity strength of generalized prismAppl. Math. Comput., 235
-
S. Brandt, Jozef Miskuf, D. Rautenbach (2008)
On a conjecture about edge irregular total labelingsJournal of Graph Theory, 57
-
T. Chunling, L. Xiaohui, Y. Yuansheng, W. Liping (2010)
Irregular total labellings of $${{C_m\square C_n}}$$ C m □ C nUtil. Math., 81
-
J.A. Gallian (2012)
A dynamic survey of graph labelingElectron. J. Comb., 19
- Publisher
- Springer Journals
- Copyright
- Copyright © 2015 by Springer Basel
- Subject
- Mathematics; Mathematics, general; Computer Science, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-015-0221-5
- Publisher site
- See Article on Publisher Site
Abstract
Let G = (V, E) be a simple, connected and undirected graph with non empty vertex set V and edge set E. An edge irregular total k-labeling $${f: V(G)\cup E(G) \to \{ 1,2, \ldots, k \}}$$ f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , k } is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights f(x) + f(xy) + f(y) and f(x′) + f(x′y′) + f(y′) are distinct. A total edge irregularity strength of graph G, denoted by tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. In this paper, we determine the exact value of the total edge irregularity strength of the generalized web graph W(n, m) and two families of related graphs.
Journal
Mathematics in Computer Science – Springer Journals
Published: May 7, 2015