Characterization of Line-Cut Signed Graphs

Title

Characterization of Line-Cut Signed Graphs

Creator

Jain R.; Acharya M.; Kansal S.

Description

A signed graphS= (Su, ?) consists of an underlying graph Su and a function ?: E(Su) ? { + , - }. For a graph G, its lict graph written as Lc(G) is the intersection graph ?(E(G) ? C(G)). For a signed graph S, its line-cutsigned graph (in short called lict signed graph) is denoted by Lc(S) has underlying graph Lc(Su) and two vertices u and v joint by negative edge if u and v both are negative adjacent edges of S or u is a negative edge incident to a cut-vertex v of negative degree odd in S and by positive edge otherwise, here C(S) is the set of cut-vertices of S. In this paper, we establish structural characterization of lict signed graphs Lc(S). 2020, The National Academy of Sciences, India.

Source

National Academy Science Letters, Vol-44, No. 2, pp. 147-150.

Date

2021-01-01

Publisher

Springer

Subject

Lict signed graph; Line signed graph; Signed graph

Coverage

Jain R., Department of Mathematics, Government College Patharia, Patharia, Dist. Damoh, 470666, M.P., India; Acharya M., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, 560029, Karnataka, India; Kansal S., Department of Applied Mathematics, Delhi Technological University, Shahbad Daulatpur, Main Bawana Road, Delhi, 110 042, India

Rights

Restricted Access

Relation

ISSN: 0250541X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1007/s40009-020-00971-7

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083200301&doi=10.1007%2fs40009-020-00971-7&partnerID=40&md5=a9fdf0865c3162c975d3cc4d45bdbc69