نتایج جستجو برای: decomposable
تعداد نتایج: 2445 فیلتر نتایج به سال:
We define the decomposable extensions of difference fields and study the irreducibility of q-Painlevé equation of type A 7 ′ . Every strongly normal extension or Liouville-Franke extension, the latter of which is a difference analogue of the Liouvillian extension, satisfies that its appropriate algebraic closure is a decomposable extension.
The present paper considers discrete probability models with exact computational properties. In relation to contingency tables this means closed form expressions of the maksimum likelihood estimate and its distribution. The model class includes what is known as decomposable graphical models, which can be characterized by a structured set of conditional independencies between some variables give...
in this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially cohen-macaulay.
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید