Total Edge Irregularity Strength of Disjoint Union of Wheel Graphs

Jeyanthi, P.; Sudha, A. Sahaya

doi:10.1016/j.endm.2015.05.026

Cited by 19 publications

(8 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Sedangkan Jeyanthy dkk. [11] memperoleh nilai total ketakteraturan titik dari beberapa jenis graf, yaitu cycle quadrilateral snake, sunflower, double wheel, fungus, triangular book, dan quadrilateral book.…”

Section: Pendahuluanunclassified

Nilai Total Ketakteraturan Titik dari Honeycomb Network

Marzuki¹

2020

JSMS

View full text Add to dashboard Cite

Topik penelitian ini adalah pelabelan total tak teratur titik pada honeycomb network. Misalkan adalah suatu graf, fungsi disebut pelabelan- total tak teratur titik (vertex irregular total -labeling) pada , jika setiap dua titik yang berbeda di mempunyai bobot yang berbeda. Bobot titik di terhadap fungsi adalah . Bilangan bulat positif terkecil sedemikian sehingga mempunyai suatu pelabelan- total tak teratur titik dinamakan nilai total ketakteraturan titik (total vertex irregularity strength) dari , dilambangkan dengan . Dari hasil penelitian ini diperoleh nilai total ketakteraturan titik dari honeycomb network yang dinotasikan dengan untuk adalah .

show abstract

Section: Pendahuluanunclassified

Nilai Total Ketakteraturan Titik dari Honeycomb Network

Marzuki¹

2020

JSMS

View full text Add to dashboard Cite

show abstract

“…Research on the of cyclic graphs for various graph classes is still being done. Several studies on the exact value of in some cyclic graphs, including some book graphs, have been conducted by [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

Total edge irregularity strength of quadruplet and quintuplet book graphs

et al. 2021

View full text Add to dashboard Cite

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-labelling is a function f : V ᴗE → {1,2,…,k} such that for any two different edges xy and x’y’ in E, their weights are distinct. The weight of edge xy is the sum of label of edge xy, labels of vertex x and of vertex y. The minimum k for which the graph G admits an edge irregular total k-labelling is called the total edge irregularity strength of G, denoted by tes(G). We have determined the total edge irregularity strength of book graphs, double book graphs and triple book graphs. In this paper, we show the exact value of the total edge irregularity strength of quadruplet book graphs and quintuplet book graphs.

show abstract

“…The motivation of Bača et al [5] behind the definition of total irregularity strength of graphs came from elsewhere [4]. A lot of work is done for both vertex and edge variants of total irregularity strength of graphs [5][6][7][8][9][10][11][12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

On the Total Vertex Irregular Labeling of Proper Interval Graphs

Rana¹

2020

J. Sci. Res.

View full text Add to dashboard Cite

A labeling of a graph is a mapping that maps some set of graph elements to a set of numbers (usually positive integers). For a simple graph G = (V, E) with vertex set V and edge set E, a labeling Φ: V ∪ E → {1, 2, ..., k} is called total k-labeling. The associated vertex weight of a vertex x∈ V under a total k-labeling Φ is defined as wt(x) = Φ(x) + ∑y∈N(x) Φ(xy) where N(x) is the set of neighbors of the vertex x. A total k-labeling is deﬁned to be a vertex irregular total labeling of a graph, if for every two different vertices x and y of G, wt(x)≠wt(y). The minimum k for which a graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G, tvs(G). In this paper, total vertex irregularity strength of interval graphs is studied. In particular, an efficient algorithm is designed to compute tvs of proper interval graphs and bounds of tvs is presented for interval graphs.

show abstract

Total Edge Irregularity Strength of Disjoint Union of Wheel Graphs

Cited by 19 publications

References 3 publications

Nilai Total Ketakteraturan Titik dari Honeycomb Network

Nilai Total Ketakteraturan Titik dari Honeycomb Network

Total edge irregularity strength of quadruplet and quintuplet book graphs

On the Total Vertex Irregular Labeling of Proper Interval Graphs

Contact Info

Product

Resources

About