C-CORDIAL LABELING OF BIPARTITE SIGNED GRAPHS
cordial labeling; diophantine equation; signed graph
Let ?:= (V, E) be a graph and ?:= (?, ?) be a signed graph with underling graph ?. Let : V (?) ?? {+, ?} be a C-marking. Then the function is called C-cordial labeling of signed graph ?, if |e? (?1) ?e? (1)| ? 1 and |v (?) ?v (+)| ? 1, where v (+) and v (?) are the number of vertices of ? having label + and ?, respectively under . In this paper, we have characterized signed cycles with given number of negative sections, which admit C-cordial labeling. We have also obtained a characterization of signed bistars which admit C-cordial labeling. 2021 Allahabad Mathematical Society.
Indian Journal of Mathematics, Vol-63, No. 1, pp. 49-57.
Acharya M., DEPARTMENT OF MATHEMATICS, CHRIST UNIVERSITY, BANGALORE, 560029, India; Pranjali, DEPARTMENT OF MATHEMATICS, UNIVERSITY OF RAJASTHAN, JLN MARG, JAIPUR, 302004, India