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...

Cijeli opis

Bibliografski detalji

Glavni autor:	Hou Shengzhe
Format:	Artigo
Jezik:	Inglês
Izdano:	Taylor & Francis Group 2025-10-01
Serija:	AKCE International Journal of Graphs and Combinatorics
Teme:	Irreducible Eisenstein’s criterion matching polynomial graph polynomial matching polynomial algorithm
Online pristup:	https://www.tandfonline.com/doi/10.1080/09728600.2025.2577959
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!