# An Essay on Comp\^onent\u{a} Analysis of Graphs

## TL;DR

This paper explores component analysis in graphs without restrictions like non-triviality and connectedness, focusing on $J$-colouring and introducing the concept of $J^c$-rainbow connectivity.

## Contribution

It extends component analysis to broader classes of graphs and introduces new concepts related to $J$-colouring and rainbow connectivity.

## Key findings

- Analysis of $J$-colouring in disconnected graphs
- Introduction of $J^c$-rainbow connectivity concept
- Insights into graph invariants without connectivity restrictions

## Abstract

In most studies related to colouring of graphs and perhaps in the study of other invariants and variants of graphs, the restrictions of non-triviality and connectedness are placed upon graphs. For the introduction to comp\^{o}nent\u{a} analysis, these restrictions are relaxed. In particular, this essay focuses on comp\^{o}nent\u{a} analysis in respect of the recently introduced $J$-colouring. The concept of $J^c$-rainbow connectivity is also introduced in this paper.