X - International Journal of Information Science and Computer Mathematics (Closed Ed TRF)
-->
Abstract: Some new results for cordial labeling of graphs are
investigated. We prove that the graphs obtained by arbitrary super subdivision
of tree, grid graph and complete bipartite graph are cordial. We also discuss
cordial labeling for the graph obtained by arbitrary super subdivisions of
Keywords and phrases: cordial labeling, cordial graphs, arbitrary super subdivisions.
