5 research outputs found

    ON THE IRREGULARITY STRENGTH AND MODULAR IRREGULARITY STRENGTH OF FRIENDSHIP GRAPHS AND ITS DISJOINT UNION

    Get PDF
    For a simple, undirected graph G with, at most one isolated vertex and no isolated edges, a labeling f:E(G)→{1,2,…,k1} of positive integers to the edges of G is called irregular if the weights of each vertex of G has a different value. The integer k1 is then called the irregularity strength of G. If the number of vertices in G or the order of G is |G|, then the labeling μ:E(G)→{1,2,…,k2}  is called modular irregular if the remainder of the weights of each vertex of G divided by |G| has a different value. The integer k2 is then called the modular irregularity strength of G. The disjoint union of two or more graphs, denoted by ‘+’, is an operation where the vertex and edge set of the result each be the disjoint union of the vertex and edge sets of the given graphs. This study discusses about the irregularity and modular irregularity strength of friendship graphs and some of its disjoint union, The result given is s(Fm ) = m + 1, ms(Fm ) = m + 1 and ms(rFm ) = rm + ⌈r/2⌉, where r denotes the number of copies of friendship graph

    Total edge irregularity strength of complete graphs and complete bipartite graphs

    Get PDF
    AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges of G with labels from the set {1,…,k} in such a way that for any two different edges e and f their weights φ(f) and φ(e) are distinct. Here, the weight of an edge g=uv is φ(g)=ν(g)+ν(u)+ν(v), i. e. the sum of the label of g and the labels of vertices u and v. The minimum k for which the graph G has an edge irregular total k-labelling is called the total edge irregularity strength of G.We have determined the exact value of the total edge irregularity strength of complete graphs and complete bipartite graphs

    Master index of volumes 161–170

    Get PDF

    Irregularity strength of the toroidal grid

    No full text
    corecore