On ? -Vertex Choosability of Graphs

Title

On ? -Vertex Choosability of Graphs

Creator

Soorya P.; Germina K.A.; Sudev N.

Description

A connected, simple graph G with vertex set V(G) = { 1 , 2 , , n} is said to be vertex (n,k)-choosable, if there exists a collection of subsets { Sk(v) ? V(G) : v? V} of cardinality k, such that Sk(u) ? Sk(v) = ? for all uv? E(G) , where k is a positive integer less than n. The maximum value of such k is called the vertex choice number of G. In this paper, we introduce the notion of ?- choosability of graphs in terms of their vertex (n,k)-choice number and initiate a study on the structural characteristics of ?-choosable graphs. 2020, The National Academy of Sciences, India.

Source

National Academy Science Letters, Vol-44, No. 4, pp. 343-346.

Date

2021-01-01

Publisher

Springer

Subject

Independence number; Vertex (n, k)-choosability; Vertex choice number; ?-vertex choosability

Coverage

Soorya P., Department of Mathematics, Central University of Kerala, Kasaragod, Kerala, India; Germina K.A., Department of Mathematics, Central University of Kerala, Kasaragod, Kerala, India; Sudev N., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, 560029, Karnataka, India

Rights

Restricted Access

Relation

ISSN: 0250541X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1007/s40009-020-01006-x

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85088839718&doi=10.1007%2fs40009-020-01006-x&partnerID=40&md5=516b3fe9d6a4a6fbf870fae96cdee582