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

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

Journal: :Discrete Mathematics 2013

Journal: :International Journal of Computer Applications 2013

vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{u...

Journal: :Opuscula Mathematica 2019

Journal: :Applied Mathematics 2011

Journal: :International Journal of Pure and Apllied Mathematics 2016

Journal: :Open Journal of Discrete Mathematics 2012

Journal: :Discussiones Mathematicae Graph Theory 2021

Hovey introduced $A$-cordial labelings as a generalization of cordial and harmonious \cite{Hovey}. If $A$ is an Abelian group, then labeling $f \colon V (G) \rightarrow A$ the vertices some graph $G$ induces edge on $G$, $uv$ receives label (u) + f (v)$. A if there vertex-labeling such that (1) vertex classes differ in size by at most one (2) induced one. The problem graphs can be naturally ext...

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

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