نتایج جستجو برای: cordial labeling

تعداد نتایج: 58050  

Journal: :The International Conference on Mathematics and Engineering Physics 2012

Journal: :Journal of Taibah University for Science 2020

Journal: :Nueva Revista de Filología Hispánica (NRFH) 1987

Journal: :International Journal for Research in Applied Science and Engineering Technology 2019

2006
John R. Platt

Scientists these days tend to keep up a polite fiction that all science is equal. Except for the work of the misguided opponent whose arguments we happen to be refuting at the time, we speak as though every scientist's field and methods of study are as good as every other scientist's and perhaps a little better. This keeps us all cordial when it comes to recommending each other for government g...

Journal: :International Journal of Advanced Engineering Research and Science 2016

Journal: :transactions on combinatorics 2012
haiying zhou wai chee shiu peter che bor lam

for a given graph $g=(v,e)$, let $mathscr l(g)={l(v) : vin v}$ be a prescribed list assignment. $g$ is $mathscr l$-$l(2,1)$-colorable if there exists a vertex labeling $f$ of $g$ such that $f(v)in l(v)$ for all $v in v$; $|f(u)-f(v)|geq 2$ if $d_g(u,v) = 1$; and $|f(u)-f(v)|geq 1$ if $d_g(u,v)=2$. if $g$ is $mathscr l$-$l(2,1)$-colorable for every list assignment $mathscr l$ with $|l(v)|geq k$ ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید