A new method for computing domination polynomials of graphs

MaRDI QIDQ2831641zbMATH OpenFDO

Authors Mohammad Reza Farahani, Hamid Hosseini

Publication date 10 November 2016

Published in Pacific Journal of Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Capra-designed planar benzenoid graphdomination polynomialmolecular graph

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• scientific article; zbMATH DE number 6423767
• Domination in certain chemical graphs
• Graph polynomials for a class of DI-pathological graphs
• Symmetry of pyrene and triphenymethane molecules
• Dominating Cartesian products of cycles

Cited in

(7)

• An application of graph theory to the estimation of bond numbers in crystals
• The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond
• scientific article; zbMATH DE number 5670538 (Why is no real title available?)
• scientific article; zbMATH DE number 4063118 (Why is no real title available?)
• scientific article; zbMATH DE number 6423767 (Why is no real title available?)
• Some new results on the total domination polynomial of a graph
• scientific article; zbMATH DE number 7583648 (Why is no real title available?)

This page was built for publication: A new method for computing domination polynomials of graphs

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