| Autor: |
P., Soorya, K. A., Germina, K., Shahul Hameed |
| Předmět: |
|
| Zdroj: |
Palestine Journal of Mathematics; 2023, Vol. 12 Issue 3, p211-215, 5p |
| Abstrakt: |
A signed graph is a graph in which each edge is labelled with +1 or -1. In this paper we define the vertex (n, k)-choosability of signed graphs which provides an extension of the vertex (n, k)-choosability of the underlying graph. Also we define the vertex choice number of a signed graph and prove some of its properties and provide bounds in terms of the vertex choice number of the underlying graph and other signed graph parameters. Also we find a characterisation for balance in bipartite signed graphs in terms of its vertex choice number. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
