Characterization of graphs using domination polynomials

From MaRDI portal
Revision as of 09:59, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:709243

DOI10.1016/j.ejc.2010.03.007zbMath1207.05092arXiv0905.3281OpenAlexW2090731186MaRDI QIDQ709243

Saieed Akbari, Yee-Hock Peng, Saeid Alikhani

Publication date: 18 October 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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




Related Items (44)

On the roots of domination polynomial of graphsOn the roots of total domination polynomial of graphsOn the graphs with four distinct domination rootsDistinctive power of the alliance polynomial for regular graphsThe average domination polynomial of graphs is unimodalOn the domination polynomial of a digraph: a generation function approachGraph operations and neighborhood polynomialsOn the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphsOn the domination polynomial of some graph operationsThe domination polynomial of a graph at \(-1\)More on the unimodality of domination polynomial of a graphConnected domination polynomial of graphsNote on the subgraph component polynomialOn the number of fair dominating sets of graphsComplete \(r\)-partite graphs determined by their domination polynomialOn the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphsRestrained domination polynomial of join and corona of graphsUnnamed ItemAlgebraic integers as chromatic and domination rootsOn the independent domination polynomial of a graphGraphs whose certain polynomials have few distinct rootsDomination polynomials of \(k\)-tree related graphsOptimal domination polynomialsThe zero forcing polynomial of a graphOn the differential polynomial of a graphThe average order of dominating sets of a graphIndependence equivalence classes of cyclesConstruction of dominating sets of certain graphsNeighborhood and domination polynomials of graphsAlliance polynomial of regular graphsOn the roots of domination polynomialsSubset-sum representations of domination polynomialsThe Domination Equivalence Classes of PathsThe number of 2-dominating sets, and 2-domination polynomial of a graphDomination polynomial of clique cover product of graphsOn the location of roots of graph polynomialsOn the doubly connected domination polynomial of a graphON THE ROOTS OF TOTAL DOMINATION POLYNOMIAL OF GRAPHS, IIUnnamed ItemUnnamed ItemOn the average order of a dominating set of a forestSome families of graphs with no nonzero real domination rootsDomination Polynomials of certain hexagon lattice graphsPerfect domination polynomial of homogeneous caterpillar graphs and of full binary trees



Cites Work


This page was built for publication: Characterization of graphs using domination polynomials