An Upper Bound On the Total Vertex Irregularity Strength of the Cartesian Product of P2 and an Arbitrary Regular Graph | Zendy

R Ramdani | Zendy; A.N.M. Salman | Zendy; Hilda Assiyatun | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Upper Bound On the Total Vertex Irregularity Strength of the Cartesian Product of P2 and an Arbitrary Regular Graph

Author(s) -

R Ramdani,

A.N.M. Salman,

Hilda Assiyatun

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.12.084

Subject(s) - cartesian product , vertex (graph theory) , combinatorics , graph , upper and lower bounds , neighbourhood (mathematics) , mathematics , cartesian coordinate system , bound graph , simple graph , discrete mathematics , graph power , geometry , line graph , mathematical analysis

Let G be a connected and simple graph with vertex set V(G) and edge set E(G). A total labeling f : V ∪ E → {1, 2,. . ., k}is called a vertex irregular total k-labeling of G if every two distinct vertices x and y in V(G) satisfy wf (x) ≠ wf (y), where. The total vertex irregularity strength of G, denoted by tvs(G), is the minimum k for which G has a vertex irregular total k-labeling. In this paper, we provide an upper bound on the total vertex irregularity strength of the Cartesian product of P2 and an arbitrary regular graph G

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research