On the domination polynomials of friendship graphs

DOI10.2298/FIL1601169AzbMath1462.05184arXiv1401.2092OpenAlexW2963356118MaRDI QIDQ5279281

Saeid Alikhani, Somayeh Jahari, Jason I. Brown

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

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

zbMATH Keywords

complex rootdomination polynomialdomination rootfriendship

Mathematics Subject Classification ID

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

Related Items (10)

The average domination polynomial of graphs is unimodal ⋮ On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs ⋮ Unnamed Item ⋮ Graph polynomials for a class of DI-pathological graphs ⋮ The number of 2-dominating sets, and 2-domination polynomial of a graph ⋮ Domination polynomial of clique cover product of graphs ⋮ On the doubly connected domination polynomial of a graph ⋮ New network entropy : The domination entropy of graphs ⋮ Some families of graphs with no nonzero real domination roots ⋮ Domination Polynomials of certain hexagon lattice graphs

This page was built for publication: On the domination polynomials of friendship graphs