Domination polynomial of clique cover product of graphs

zbMath1446.05067arXiv1605.02291MaRDI QIDQ5130686

Saeid Alikhani, Somayeh Jahari

Publication date: 28 October 2020

Full work available at URL: https://arxiv.org/abs/1605.02291

zbMATH Keywords

domination polynomialclique coverfriendship graphs\( \mathcal{D} \)-equivalence class

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the domination polynomial of some graph operations
• Recurrence relations and splitting formulas for the domination polynomial
• Domination polynomials of \(k\)-tree related graphs
• Characterization of graphs using domination polynomials
• Complete \(r\)-partite graphs determined by their domination polynomial
• A unified approach to the first derivatives of graph polynomials
• On the corona of two graphs
• An atlas of domination polynomials of graphs of order at most six
• Introduction to Domination Polynomial of a Graph
• On the domination polynomials of friendship graphs
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees

This page was built for publication: Domination polynomial of clique cover product of graphs