EDGECUT POLYNOMIAL OF GRAPHS

DOI10.17654/DM025010071MaRDI QIDQ5075603zbMATH OpenOpenAlexFDO

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/dm025010071

zbMATH Keywords

edgecut polynomialstandard edgecut

Mathematics Subject Classification ID

Graph polynomials (05C31)

Cites work

• scientific article; zbMATH DE number 3777553 (Why is no real title available?)
• Some polynomials of flower graphs
• The cordiality of one-point union of n copies of a graph

Cited in

(4)

• Refined node polynomials via long edge graphs
• Using Edge-Induced and Vertex-Induced Subhypergraph Polynomials
• scientific article; zbMATH DE number 6921365 (Why is no real title available?)
• A Most General Edge Elimination Polynomial

This page was built for publication: EDGECUT POLYNOMIAL OF GRAPHS

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