An Essay on Comp\^onent\u{a} Analysis of Graphs
General Mathematics
2017-05-08 v1
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 -colouring. The concept of -rainbow connectivity is also introduced in this paper.
Keywords
Cite
@article{arxiv.1705.02097,
title = {An Essay on Comp\^onent\u{a} Analysis of Graphs},
author = {Johan Kok and Sudev Naduvath},
journal= {arXiv preprint arXiv:1705.02097},
year = {2017}
}
Comments
8 Pages