Strongly Multiplicative Labeling in the Context of Arbitrary Supersubdivision

Strongly Multiplicative Labeling in the Context of Arbitrary Supersubdivision

We investigate some new results for strongly multiplicative labeling of graph. We prove that the graph obtained by arbitrary supersubdivision of tree T , grid graph Pn × Pm, complete bipartite graph Km,n, Cn Pm and one-point union of m cycle of length n are strongly multiplicative.

Some New Results on Cordial Labeling in the Context of Arbitrary Supersubdivision of Graph

In this paper we discuss cordial labeling in the context of arbitrary supersubdivision of graph. We prove that the graphs obtained by arbitrary supersubdivision of path as well as star admit cordial labeling. In addition to this we prove that the graph obtained by arbitrary supersubdivision of cycle is cordial except when n and all mi are simultaneously odd numbers. Mathematics Subject Classifi...

The Maximum Number of Edges in a Strongly Multiplicative Graph

the effect of learning strategies on the speaking ability of iranian students in the context of language institutes

the effect of learning strategies on the speaking ability of iranian students in the context of language institutes abstract language learning strategies are of the most important factors that help language learners to learn a foreign language and how they can deal with the four language skills specifically speaking skill effectively. acknowledging the great impact of learning strategies...

Strongly Multiplicative Labeling of Some Snake Related Graphs

Abstract: A graph G with p vertices is said to be strongly multiplicative if the vertices of G can be labeled with p consecutive positive integers 1, 2, ..., p such that label induced on the edges by the product of labels of end vertices are all distinct. In this paper we investigate strongly multiplicative labeling of some snake related graphs. We prove that alternate triangular snake and alte...