http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
On Prime Cordial Labeling of Graphs
Aljouiee, Abdullah Department of Mathematics 2016 Kyungpook mathematical journal Vol.56 No.1
A graph G of order n has prime cordial labeling if its vertices can be assigned the distinct labels 1, $2{\cdots}$, n such that if each edge xy in G is assigned the label 1 in case the labels of x and y are relatively prime and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we give a complete characterization of complete graphs which are prime cordial and we give a prime cordial labeling of the closed helm ${\bar{H}}_n$, and present a new way of prime cordial labeling of $P^2_n$. Finally we make a correction of the proof of Theorem 2.5 in [12].
Inverse of Frobenius Graphs and Flexibility
Aljouiee, Abdulla Department of Mathematics 2005 Kyungpook mathematical journal Vol.45 No.4
Weak Crossed Product Algebras correspond to certain graphs called lower subtractive graphs. The properties of such algebras can be obtained by studying this kind of graphs ([4], [5]). In [1], the author showed that a weak crossed product is Frobenius and its restricted subalgebra is symmetric if and only if its associated graph has a unique maximal vertex. A special construction of these graphs came naturally and was known as standard lower subtractive graph. It was a deep question that when such a special graph possesses unique maximal vertex? This work is to answer the question partially and to give a particular characterization for such graphs at which the corresponding algebras are isomorphic. A graph that follows the mentioned characterization is called flexible. Flexibility is to some extend a generalization of the so-called Coxeter groups and its weak Bruhat ordering.