Independent domination polynomials of binary sequence graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4112649 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 568836 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- Characterization of graphs using domination polynomials
- Chromatic Polynomials
- Complete r-partite graphs determined by their domination polynomial
- Complex zeros, unimodality and log-concavity in independent domination polynomial of zero divisor graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- Eigenvalue location for chain graphs
- Independent domination in graphs: A survey and recent results
- Independent domination polynomial for the cozero divisor graph of the ring of integers modulo \(n\)
- Introduction to domination polynomial of a graph.
- Log-Concavity of Combinations of Sequences and Applications to Genus Distributions
- Log-concavity of independence polynomials of some kinds of trees
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- On nested split graphs whose second largest eigenvalue is less than 1
- On the cover polynomial of a digraph
- On the independence polynomial of the corona of graphs
- On the independent domination polynomial of a graph
- On the unimodality of independence polynomials of some graphs
- Polynomials
- Polynomials with palindromic and unimodal coefficients
- Trees with real rooted independence polynomials
- Tutte Polynomials and Link Polynomials
This page was built for publication: Independent domination polynomials of binary sequence graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268179)
