On D-equivalence classes of some graphs

MaRDI QIDQ2954283zbMATH OpenFDO

Authors Saeid Alikhani, Somayeh Jahari

Publication date 12 January 2017

Full work available at URL http://academy.giasher.com/moambe/t10-n1/02-Alikhani.pdf

zbMATH Keywords

equivalencedomination polynomialD-unique graphgeneralized barbell graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On the D-equivalence class of graph
• On \(\mathcal D\)-equivalence class of complete bipartite graphs.
• Characterization of graphs using domination polynomials
• The Domination Equivalence Classes of Paths
• Domination polynomial of generalized book graphs

Cited in

(8)

• On graph entropy measures based on the number of dominating and power dominating sets
• Independence equivalence classes of cycles
• On the D-equivalence class of graph
• Domination polynomial of clique cover product of graphs
• scientific article; zbMATH DE number 5291590 (Why is no real title available?)
• scientific article; zbMATH DE number 1404134 (Why is no real title available?)
• On \(\mathcal D\)-equivalence class of complete bipartite graphs.
• The Domination Equivalence Classes of Paths

This page was built for publication: On D-equivalence classes of some graphs

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