On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices

Isnaini Rosyida; Eka Ningrum; Mulyono; Diari Indriati

doi:10.1080/09720529.2020.1820704

← Back to search

On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices

Closed

Isnaini Rosyida, Eka Ningrum, Mulyono, Diari Indriati

2020 Journal of Discrete Mathematical Sciences and Cryptography Vol. 23 Issue 6 Article Cited by 6 SDG 15SDG 16

Abstract

Let G(V, E) be a graph. Throughout this paper, we use the notions of edge irregular total k-labeling and total edge irregularity strength of G (tes (G)). We verify tes of general uniform cactus chain graphs (Figure presented.) having (n - 2)r pendant vertices and length r. The result obtained is as follows: (Figure presented.) for n ≥ 6. © 2020 Taru Publications.

Affiliations

Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Semarang, Indonesia; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Semarang, Indonesia; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Semarang, Indonesia; Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, Surakarta, Indonesia

View full text (DOI) →

Research at a Glance

Research at a Glance

Topics & SDG Alignment

Collaboration

Author Profile (Selected)

References Overview

Journal & Source

Metadata & Integrity