نتایج جستجو برای: connected graph
تعداد نتایج: 300740 فیلتر نتایج به سال:
the rings considered in this article are commutative with identity which admit at least two nonzero annihilating ideals. let $r$ be a ring. let $mathbb{a}(r)$ denote the set of all annihilating ideals of $r$ and let $mathbb{a}(r)^{*} = mathbb{a}(r)backslash {(0)}$. the annihilating-ideal graph of $r$, denoted by $mathbb{ag}(r)$ is an undirected simple graph whose vertex set is $mathbb{a}(r)...
an oriented perfect path double cover (oppdc) of a graph $g$ is a collection of directed paths in the symmetric orientation $g_s$ of $g$ such that each arc of $g_s$ lies in exactly one of the paths and each vertex of $g$ appears just once as a beginning and just once as an end of a path. maxov{'a} and ne{v{s}}et{v{r}}il (discrete math. 276 (2004) 287-294) conjectured that ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید