نتایج جستجو برای: edge ideal
تعداد نتایج: 197645 فیلتر نتایج به سال:
We study the initial ideal of binomial edge ideal in degree 2 ([in<(JG)]2), associated to a graph G. We computed dimension, depth, Castelnuovo-Mumford regularity, Hilbert function and Betti numbers of [in<(JG)]2 for some classes of graphs. AMS Mathematics Subject Classification (2010): 05E40, 16E30
Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.
We study the initial ideal of binomial edge ideal in degree 2 ([in<(JG)]2), associated to a graph G. We computed dimension, depth, Castelnuovo-Mumford regularity, Hilbert function and Betti numbers of [in<(JG)]2 for some classes of graphs. AMS Mathematics Subject Classification (2010): 05E40, 16E30
An ideal triangulation of a compact \( 3 \)-manifold with nonempty boundary is known to be minimal if and only the contains minimum number edges among all triangulations manifold. Therefore, every one-edge (i.e., an singular exactly one edge) minimal. Vesnin, Turaev, Fominykh showed that two-edge no \)–\( 2 \) Pachner move can applied. In this paper we show each so-called poor three-edge We exp...
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.
Edge detection is a very important preprocess for image processing research, we can decide the information about position, contours or size of the object by the features of image edge that detected by edge detection, and approach of pattern recognition and information retrial. But in general the edge detection methods, are required to manually select the parameters of an ideal edge to detect th...
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید