CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS

DOI10.17654/0974165823036OpenAlexW4376506403MaRDI QIDQ6170296FDOQ6170296

Authors: Rosalio G. Jun. Artes 

Publication date: 15 August 2023

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/0974165823036

zbMATH Keywords

independent setconnected dominating setconnected dominating independent neighborhood polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)

Cites Work

• Introduction to domination polynomial of a graph.
• Clique polynomials and independent set polynomials of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The neighbourhood polynomial of a graph
• Graph polynomials and their applications. II: Interrelations and interpretations
• Title not available (Why is that?)
• CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS

Cited In (5)

• Title not available (Why is that?)
• Neighborhood and domination polynomials of graphs
• Combinatorial approach in counting the neighbors of cliques in a graph
• Convex neighborhood polynomial of graphs
• Independent sets in the neighborhood systems of balanced bicliques: optimization and polynomial representations

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)