Year: 2026
Type: article
Abstract: We introduce the doubly convex neighborhood polynomial of a graph, which encodes both the convexity of vertex subsets and the convex structure of their neighborhood systems. We establish basic properties, and derive explicit expressions for paths, star graphs, and complete graphs. We show that the polynomial captures both local and global convexity features, extending existing graph polynomial frameworks.
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W7155355997
