A new family of chromatically unique 6-bridge graph
Abstract: For a graph G, let P(G,λ) denote the chromatic polynomial of G. Two graphs G and H are chromatically equivalent (or simply χ-equivalent), denoted by G∼ H, if P(G,λ)=P(H,λ). A graph G is chromatically unique (or simply χ-unique) if for...
Guardado en:
| Autores principales: | , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2018
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000200239 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172018000200239 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720180002002392018-05-29A new family of chromatically unique 6-bridge graphKarim,N. S. A.Hasni,R. Chromatic polynomial Chromatically unique 6-bridge graph. Abstract: For a graph G, let P(G,λ) denote the chromatic polynomial of G. Two graphs G and H are chromatically equivalent (or simply χ-equivalent), denoted by G∼ H, if P(G,λ)=P(H,λ). A graph G is chromatically unique (or simply χ-unique) if for any graph H such as H∼ G, we have H≅ G, i.e, H is isomorphic to G. In this paper, the chromatic uniqueness of a new family of 6-bridge graph θ (a,a,b,b,b,c) where 2≤ a≤ b≤ c, is investigated.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.37 n.2 20182018-06-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000200239en10.4067/S0716-09172018000200239 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Chromatic polynomial Chromatically unique 6-bridge graph. |
| spellingShingle |
Chromatic polynomial Chromatically unique 6-bridge graph. Karim,N. S. A. Hasni,R. A new family of chromatically unique 6-bridge graph |
| description |
Abstract: For a graph G, let P(G,λ) denote the chromatic polynomial of G. Two graphs G and H are chromatically equivalent (or simply χ-equivalent), denoted by G∼ H, if P(G,λ)=P(H,λ). A graph G is chromatically unique (or simply χ-unique) if for any graph H such as H∼ G, we have H≅ G, i.e, H is isomorphic to G. In this paper, the chromatic uniqueness of a new family of 6-bridge graph θ (a,a,b,b,b,c) where 2≤ a≤ b≤ c, is investigated. |
| author |
Karim,N. S. A. Hasni,R. |
| author_facet |
Karim,N. S. A. Hasni,R. |
| author_sort |
Karim,N. S. A. |
| title |
A new family of chromatically unique 6-bridge graph |
| title_short |
A new family of chromatically unique 6-bridge graph |
| title_full |
A new family of chromatically unique 6-bridge graph |
| title_fullStr |
A new family of chromatically unique 6-bridge graph |
| title_full_unstemmed |
A new family of chromatically unique 6-bridge graph |
| title_sort |
new family of chromatically unique 6-bridge graph |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2018 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172018000200239 |
| work_keys_str_mv |
AT karimnsa anewfamilyofchromaticallyunique6bridgegraph AT hasnir anewfamilyofchromaticallyunique6bridgegraph AT karimnsa newfamilyofchromaticallyunique6bridgegraph AT hasnir newfamilyofchromaticallyunique6bridgegraph |
| _version_ |
1718439834056392704 |