Coloring of Non-zero Component Graphs

Title

Coloring of Non-zero Component Graphs

Creator

Mathew V.M.; Naduvath S.

Description

The non-zero component graph of a finite dimensional vector space V over a finite field F is the graph G(V?) = (V, E), where vertices of G(V?) are the non-zero vectors in V, two of which are adjacent if they share at least one basis vector with non-zero coefficient in their basic representation. In this paper, we study the various types of colorings of non-zero component graph. (2024), (Universidad Catolica del Norte). All rights reserved.

Source

Proyecciones, Vol-43, No. 4, pp. 883-898.

Date

2024-01-01

Publisher

Universidad Catolica del Norte

Subject

chromatic number; coloring; Non-zero component graph

Coverage

Mathew V.M., CHRIST (Deemed to be University, India; Naduvath S., CHRIST (Deemed to be University, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 7160917

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22199/issn.0717-6279-5962

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85193624621&doi=10.22199%2fissn.0717-6279-5962&partnerID=40&md5=0e0b523b13ccd089dbe0973b7162f3dd