CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS
From MaRDI portal
Publication:6170296
Cites work
- scientific article; zbMATH DE number 4065035 (Why is no real title available?)
- scientific article; zbMATH DE number 3708283 (Why is no real title available?)
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- scientific article; zbMATH DE number 2229025 (Why is no real title available?)
- CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS
- Clique polynomials and independent set polynomials of graphs
- Graph polynomials and their applications. II: Interrelations and interpretations
- Introduction to domination polynomial of a graph.
- The neighbourhood polynomial of a graph
Cited in
(5)- scientific article; zbMATH DE number 969982 (Why is no real title available?)
- Neighborhood and domination polynomials of graphs
- Independent sets in the neighborhood systems of balanced bicliques: optimization and polynomial representations
- Combinatorial approach in counting the neighbors of cliques in a graph
- Convex neighborhood polynomial of graphs
This page was built for publication: CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170296)