The construction of graphs with irreducible matching polynomials and their generalizations
This paper investigates methods for constructing graphs whose matching polynomials are irreducible over [Formula: see text]. Building on this, the construction method is extended to general graph polynomials, for graphs whose polynomials satisfy certain properties, the connection construction produc...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Taylor & Francis Group
2025-10-01
|
| Serie: | AKCE International Journal of Graphs and Combinatorics |
| Soggetti: | |
| Accesso online: | https://www.tandfonline.com/doi/10.1080/09728600.2025.2577959 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|