On the doubly connected domination polynomial of a graph

DOI10.1142/S1793557119500360zbMath1414.05150OpenAlexW2797787604WikidataQ130039736 ScholiaQ130039736MaRDI QIDQ4966673

No author found.

Publication date: 27 June 2019

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557119500360

zbMATH Keywords

domination polynomialfriendship graphcactus chain graphdoubly connected set

Mathematics Subject Classification ID

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

Related Items (2)

Disprove of a conjecture on the doubly connected domination subdivision number ⋮ The number of 2-dominating sets, and 2-domination polynomial of a graph

Cites Work

• On the roots of domination polynomial of graphs
• Graph products of the trivariate total domination polynomial and related polynomials
• Recurrence relations and splitting formulas for the domination polynomial
• Characterization of graphs using domination polynomials
• A unified approach to the first derivatives of graph polynomials
• On the roots of domination polynomials
• On the doubly connected domination number of a graph
• On the corona of two graphs
• Dominatind sets and domination polynomials of certain graphs. II
• Mean value for the matching and dominating polynomial
• Introduction to Domination Polynomial of a Graph
• On the domination polynomials of friendship graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the doubly connected domination polynomial of a graph