Cargando…
Anti-Kekulé number of the {(3, 4), 4}-fullerene(*)
A {(3,4),4}-fullerene graph G is a 4-regular plane graph with exactly eight triangular faces and other quadrangular faces. An edge subset S of G is called an anti-Kekulé set, if G − S is a connected subgraph without perfect matchings. The anti-Kekulé number of G is the smallest cardinality of anti-K...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Frontiers Media S.A.
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10000290/ https://www.ncbi.nlm.nih.gov/pubmed/36909705 http://dx.doi.org/10.3389/fchem.2023.1132587 |