Chromatically Unique 6-bridge Graph Theta(a,a,a,b,b,c)
2016
N. S. A. Karim, Roslan Hasni, Gee-Choon Lau

Metrics

  • Eye Icon 183 views
  • Download Icon 65 downloads
Metrics Icon 183 views  //  65 downloads
Chromatically Unique 6\u002Dbridge Graph Theta(a,a,a,b,b,c) Image
Abstract

For a graph $G$, let $P(G,\lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if for any graph chromatically equivalent to $G$ is isomorphic to $G$. In this paper, the chromatically unique of a new family of 6-bridge graph $\theta(a,a,a,b,b,c)$ where $2\le a\le b\le c$ is investigated.

Full text
Show more arrow
 
More from this journal
On Open Neighborhood Locating-dominating in Graphs
On Open Neighborhood Locating\u002Ddominating in Graphs Image
Cofinite Graphs and Their Profinite Completions
Cofinite Graphs and Their Profinite Completions Image
🧐  Browse all from this journal

Metrics

  • Eye Icon 183 views
  • Download Icon 65 downloads
Metrics Icon 183 views  //  65 downloads