ON THE VERTEX CONNECTIVITY POLYNOMIAL OF GRAPHS

DOI10.17654/DM026020133zbMATH Open1499.05318OpenAlexW3134612326MaRDI QIDQ5076103FDOQ5076103

Authors:

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm026020133

zbMATH Keywords

vertex connectivity polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Connectivity (05C40)

Cites Work

• On the corona of two graphs
• Title not available (Why is that?)
• On some counting polynomials in chemistry

Cited In (5)

• Connectedness of digraphs from quadratic polynomials
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS

This page was built for publication: ON THE VERTEX CONNECTIVITY POLYNOMIAL OF GRAPHS

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