Connected domination polynomial of graphs
From MaRDI portal
Publication:1673572
Recommendations
Cites work
Cited in
(17)- Connectedness of digraphs from quadratic polynomials
- Domination polynomials of cubic graphs of order 10
- Cycles are determined by their domination polynomials.
- The domination polynomial of a graph at -1
- scientific article; zbMATH DE number 6921365 (Why is no real title available?)
- Some families of graphs whose domination polynomials are unimodal
- The co-connected domination polynomial of a graph
- Hop domination polynomial of graphs
- Domination topological indices and their polynomials of a firefly graph
- scientific article; zbMATH DE number 7527867 (Why is no real title available?)
- Domination polynomial of clique cover product of graphs
- A study of mixed tree domination polynomials in some class of graphs
- Categorifying connected domination via graph überhomology
- Enumerating conjugacy classes of graphical groups over finite fields
- THE NUMBER OF CC-DOMINATING SETS OF SOME GRAPHS
- On the Roman domination polynomials
- The edge geodetic fault tolerant domination number of a graph
This page was built for publication: Connected domination polynomial of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673572)