WIWidodo

Widodo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Widodo has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On total irregularity strength of caterpillar graphs with two leaves on each internal vertex

    by I Rosyida, Widodo, D Indriati

    Let G(V, E) be a graph. A function f from to the set {1, 2, ..., k} is said to be a totally irregular total k-labeling of G if the weights of any two different vertices x and y in V (G) satisfy where the weight wf (x) is the sum of label of x and labels of all edges incident to x, and the weights of any two different edges ux and vy in E(G) satisfy where the weight wf (ux) is obtained from the sum of: label of x, label of u and label of edge ux. The total irregularity strength of the graph G, denoted by ts(G), is the minimum number k for which G has a totally irregular total k-labeling. In this paper, we focus on a caterpillar graph with two leaves on each internal vertex T 2n+p,q , where n is the number of leaves on each end vertex of the central path, p is the number of leaves connected to internal vertices, q is the number of vertices of the central path, p > 4 and q > 4. Firstly, we do some experiments for constructing a formula for totally irregular total k-labeling of the caterpillar graph T 2n+p,q . Secondly, we determine the minimum number k which is ts of the caterpillar graph T 2n+p,q . We obtain that and .


  • On total irregularity strength of star graphs, double-stars and caterpillar

    by Diari Indriati, Widodo, Indah E. Wijayanti, Kiki A. Sugeng

    For a simple graph G = (V, E) with the vertex set V and the edge set E, a totally irregular total k-labeling f : V ∪ E → {1, 2,…, k} is a labeling of vertices and edges of G in such a way that for any two different vertices x and x′, their weights wt f (x) = f(x) + ∑ xy∈E f (xy) and wtf (x′) = f (x′) + ∑ x′ y′ ∈E f (x′y′) are distinct, and for any two different edges xy and x′y′ their weights f (x) + f (xy) + f (y) and f (x′) + f (x′y′) + f (y′) are also distinct. A total irregularity strength of graph G, denoted by ts(G), is defined as the minimum k for which G has a totally irregular total k-labeling. In this paper, we determine the exact value of the total irregularity strength for star graphs, double stars and caterpillar.

  • On Total Edge Irregularity Strength of Generalized Web Graphs and Related Graphs

    by Diari Indriati, Widodo, Indah E. Wijayanti, Kiki A. Sugeng, Martin Bača