C-CORDIAL LABELING OF BIPARTITE SIGNED GRAPHS

Title

C-CORDIAL LABELING OF BIPARTITE SIGNED GRAPHS

Creator

Acharya M.; Pranjali

Description

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.

Source

Indian Journal of Mathematics, Vol-63, No. 1, pp. 49-57.

Date

2021-01-01

Publisher

Allahabad Mathematical Society

Subject

cordial labeling; diophantine equation; signed graph

Coverage

Acharya M., DEPARTMENT OF MATHEMATICS, CHRIST UNIVERSITY, BANGALORE, 560029, India; Pranjali, DEPARTMENT OF MATHEMATICS, UNIVERSITY OF RAJASTHAN, JLN MARG, JAIPUR, 302004, India

Rights

Restricted Access

Relation

ISSN: 195324

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85132111077&partnerID=40&md5=fa5e30ab08ee9f363d87a68a8c8c5120