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

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

Journal: :Discrete Mathematics 1993

Journal: :Mathematics and Statistics 2020

Journal: :Stochastic Processes and their Applications 2010

Journal: :Journal of Scientific Research 2014

Journal: :Open Journal of Discrete Mathematics 2020

Journal: :International Journal of Pure and Apllied Mathematics 2017

Journal: :Opuscula Mathematica 2010

2015
Sathish Narayanan

A graph G = (V,E) with p vertices and q edges is said to be a Total Mean Cordial graph if there exists a function f : V (G) → {0, 1, 2} such that for each edge xy assign the label ⌈ f(x)+f(y) 2 ⌉ where x, y ∈ V (G), and the total number of 0, 1 and 2 are balanced. That is |evf (i)− evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0,...

Journal: :Open Journal of Discrete Mathematics 2012

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

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