Combinatorial approach in counting the neighbors of cliques in a graph

DOI10.17654/0974165823063MaRDI QIDQ6490050

Alcyn R. Bakkang, Rosalio G. Jun. Artes, Unnamed Author

Publication date: 22 April 2024

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

zbMATH Keywords

cliqueneighborhood systemclique neighborhood polynomial

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the unimodality of independence polynomials of some graphs
• Clique polynomials and independent set polynomials of graphs
• Graph Polynomials and Their Applications II: Interrelations and Interpretations
• CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS
• CONNECTED COMMON NEIGHBORHOOD SYSTEMS OF CLIQUES IN A GRAPH: A POLYNOMIAL REPRESENTATION
• INDUCED CYCLE POLYNOMIAL OF A GRAPH
• CONNECTED TOTAL DOMINATING NEIGHBORHOOD POLYNOMIAL OF GRAPHS
• POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS
• FROM GRAPHS TO POLYNOMIAL RINGS: STAR POLYNOMIAL REPRESENTATION OF GRAPHS
• CONVEX INDEPENDENT COMMON NEIGHBORHOOD POLYNOMIAL OF A GRAPH
• COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS
• CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS
• STAR POLYNOMIAL OF THE CORONA OF GRAPHS
• INDUCED PATH POLYNOMIAL OF GRAPHS

This page was built for publication: Combinatorial approach in counting the neighbors of cliques in a graph