arXiv (All)
open access
$\textbf{k}$-neighborhood ideals of graphs
In this paper, we introduce and investigate the $\textbf{k}$-neighborhood ideal of a graph, a natural generalization of the closed neighborhood ideal. Let $G$ be a simple graph on the vertex set $[n]$, and let $S=K[x_1,\dots,x_n]$ be the polynomial ring over a field $K$. For a vector $\textbf{k}=(k_
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Erdős-Hajnal Property for the six-vertex Graph with Edge Set $\{ab,bc,cd,de,af,bf,df\}$#792548
- Symbolic Rees algebras of complementary edge ideals#927472
- Systems of parameters consisting of linear forms for monomial ideal quotients#1078152
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Cartwright--Sturmfelsness of complementary determinantal edge ideals#1217187
Record · ID 1327414
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive