Iterative methods in computing independence and matching polynomials of 4-regular 4-connected planar graphs

DOI10.14317/JAMI.2025.1817MaRDI QIDQ6858565zbMATH OpenFDO

Authors Nakshee Mehta, S. Veeramani

Publication date 12 February 2026

Published in Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14317/JAMI.2025.1817

zbMATH Keywords

connectivityindependence polynomialmatching polynomialplanar graphsgraph indices

Mathematics Subject Classification ID

Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 3950568 (Why is no real title available?)
• scientific article; zbMATH DE number 3697162 (Why is no real title available?)
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• Clique polynomials and independent set polynomials of graphs
• Fibonacci numbers and Lucas numbers in graphs
• Matching polynomials and independence polynomials of benzenoid chains
• Mathematical aspects of fullerenes
• On the theory of the matching polynomial
• \(M\)-polynomial and degree-based topological indices

This page was built for publication: Iterative methods in computing independence and matching polynomials of 4-regular 4-connected planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858565)