We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in terms of the combinatorics of "weighted vertex covers". ...
and only if all powers ofI(D)I(𝒟)have linear quotients. We provide a lower bound for the regularity of powers of edge ideals of weighted oriented graphs in terms of induced matching. Finally, we obtain a general upper bound for the regularity of edge ideals of weighted oriented graphs....
Symbolic powers of edge ideals of weighted oriented graphs Let D D be a weighted oriented graph and I(D) I(D) be its edge ideal. We provide one method to find all the minimal generators of I_{\\subseteq C} I_{\... M Mandal,DK Pradhan 被引量: 0发表: 2022年 Regularity of symbol...
Edge-weighted graphs compatible with Graphs.jl. Contribute to JuliaGraphs/SimpleWeightedGraphs.jl development by creating an account on GitHub.
for edge weighted graphs if k ≥ 10. 青云英语翻译 请在下面的文本框内输入文字,然后点击开始翻译按钮进行翻译,如果您看不到结果,请重新翻译! 翻译结果1翻译结果2翻译结果3翻译结果4翻译结果5 翻译结果1复制译文编辑译文朗读译文返回顶部 如果边缘加权图K≥10。
If each of the edges bears the weight 1, i.e., the function f(x,y)≡1, then the adjacency matrix of G is simply denoted by A(G). Because we study the interlacing results of weighted adjacency eigenvalues under some graph perturbations, firstly, we define some operations on graphs. ...
Linear systems and Riemann-Roch theory on graphs We show that for any subring of the reals, the Riemann-Roch formula can be generalized to -valued divisors on edge-weighted graphs over . We also ... R James - Dissertations & Theses - Gradworks 被引量: 0发表: 2010年 Submitted by Rodney...
aWe extend the notion of spanning tree congestion to edge weighted graphs, by defining the con- 我们对边缘被衡量的图表扩大生成树壅塞的概念,由de ning精读的fi [translate] 英语翻译 日语翻译 韩语翻译 德语翻译 法语翻译 俄语翻译 阿拉伯语翻译 西班牙语翻译 葡萄牙语翻译 意大利语翻译 荷兰语翻译 瑞典...
aWe extend the notion of spanning tree congestion to edge weighted graphs, by defining the congestion of an edge as the sum of the weights of edges whose detours pass through the edge. 我们对边缘被衡量的图表扩大生成树壅塞的概念,由de ning边缘的壅塞的fi作为的重量的总和改道穿过边缘边缘。[...
A Chernoff bound for random walks on expander graphs We consider a finite random walk on a weighted graph G; we show that the sample average of visits to a set of vertices A converges to the stationary probab... D Gillman - Symposium on Foundations of Computer Science 被引量: 324发表: ...