نتایج جستجو برای: totally
تعداد نتایج: 28849 فیلتر نتایج به سال:
Journal:
:Transactions of the American Mathematical Society
1973
Journal:
:Discrete Applied Mathematics
1987
Journal:
Journal of Algorithms and Computation
2015
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
Journal:
:Acta Arithmetica
2015
Journal:
:Bulletin of the American Mathematical Society
1977
Journal:
:Bulletin of the Australian Mathematical Society
2002
Journal:
:Bulletin of the American Mathematical Society
1939
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید