Vertex (n, k)-choosability of graphs

Authors

  • Germina K. Augusthy Central University of Kerala - Department of Mathematics
  • P. Soorya Central University of Kerala - Department of Mathematics

Keywords:

choosability, vertex (n, k)-choosability

Abstract

Let G = (V, E), connected, simple graph of order n and size m and let V(G) = {1, 2, ..., n}.  A graph G = (V, E) is said to be vertex (n, k)-choosable, if there exists a collection of subsets of the vertex set, {Sk(v) : v ∈ V} of cardinality k, such that Sk(u) ∩ Sk(v) = ∅ for all uv ∈ E(G).  This paper initiates a study on vertex (n, k)-choosable graphs and finds the different integer values of k, for which the given graph is vertex (n, k)-choosable.

Cover of n°43 Italian Journal of Pure and Applied Mathematics

Downloads

Published

2020-02-14

How to Cite

Augusthy, G. K., & Soorya, P. (2020). Vertex (n, k)-choosability of graphs. Italian Journal of Pure and Applied Mathematics, 43, 905–911. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7277

Issue

N°43 - February 2020

Section

Articoli - Forum Editrice

License

Copyright (c) 2020 Germina K. Augusthy, P. Soorya

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

L'opera è pubblicata sotto  Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)