نتایج جستجو برای: sum contrasts
تعداد نتایج: 93082 فیلتر نتایج به سال:
Journal:
:CoRR
2017
Matej Konecný
Stanislav Kucera
Jana Novotná
Jakub Pekárek
Stepán Simsa
Martin Töpfer
A graph G is called a sum graph if there is a so-called sum labeling of G, i.e. an injective function l : V (G) → N such that for every u, v ∈ V (G) it holds that uv ∈ E(G) if and only if there exists a vertex w ∈ V (G) such that l(u) + l(v) = l(w). We say that sum labeling l is minimal if there is a vertex u ∈ V (G) such that l(u) = 1. In this paper, we show that if we relax the conditions (ei...
Journal:
:Pedagogical Linguistics
2020
Journal:
:Glossa: a journal of general linguistics
2017
Journal:
:SSRN Electronic Journal
2015
Journal:
:Annual Meeting of the Berkeley Linguistics Society
2011
Journal:
:Progress in Oceanography
2017
Journal:
:The Journal of the Acoustical Society of America
2005
Journal:
:Contemporary Music Review
1989
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید