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...

For example is a chromatic number with the smallest integer so that graph has true vertex coloring k color. Chromatic still an interesting study which being studied for its development through coloring. Graph special case of labeling. Labeling here means, giving color to points at certain limit no two vertices have same This aims calculate in several classes graphs including , Based on results ...

Graph theory plays a significant role in variety of real-world systems. concepts such as labeling and coloring are used to depict processes relationships material, social, biological, physical, information Specifically, graph is communication network addressing, fault-tolerant system design, automatic channel allocation, etc. 2-odd assigns distinct integers the nodes <img src=image/13427595_01....