Irregular total labeling of disjoint union of prisms and cycles


Abstract:

We investigate two modifications of the well-known irregularity strength of graphs, namely, a total edge irregularity strength and a total vertex irregularity strength. Recently the bounds and precise values for some families of graphs concerning these parameters have been determined. In this paper, we determine the exact value of the total edge (vertex) irregularity strength for the disjoint union of prisms and the total edge (vertex) irregularity strength for the disjoint union of cycles.

Año de publicación:

2014

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Article

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Teoría de grafos
    • Optimización matemática
    • Optimización matemática

    Áreas temáticas:

    • Ciencias de la computación