On chromatic polynomial of certain families of dendrimer graphs

On chromatic polynomial of certain families of dendrimer graphs

Let \(G\) be a simple graph with vertex set \(V(G)\) and edge set \(E(G)\). A mapping \(g:V (G)\rightarrow\{1,2,...t\}\) is called \(t\)-coloring if for every edge \(e = (u, v)\), we have \(g(u) \neq g(v)\). The chromatic number of the graph \(G\) is the minimum number of colors that are required to...

Full description

Bibliographic Details
Main Authors: Aqsa Shah, Syed Ahtsham Ul Haq Bokhar
Format: Article
Language:English
Published: Ptolemy Scientific Research Press 2019-12-01
Series:Open Journal of Mathematical Sciences
Subjects:
t-coloring
chromatic polynomials
dendrimer nanostars.
Online Access:https://pisrt.org/psr-press/journals/oms-vol-3-2019/on-chromatic-polynomial-of-certain-families-of-dendrimer-graphs/

Internet

https://pisrt.org/psr-press/journals/oms-vol-3-2019/on-chromatic-polynomial-of-certain-families-of-dendrimer-graphs/

Similar Items