On the number of connected sets with the neighborhood of a given size in a graph

DOI10.1016/S0166-218X(00)00372-3zbMath0996.05078OpenAlexW2033972669MaRDI QIDQ5954094

Alexander A. Sapozhenko

Publication date: 30 January 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00372-3

zbMATH Keywords

enumerationneighborhood

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• On the number of connected subgraphs with small edge‐boundary in regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of connected sets with the neighborhood of a given size in a graph