شماره ركورد كنفرانس :
4819
عنوان مقاله :
ON THE LEXICOGRAPHIC PRODUCT OF GRAPHS
پديدآورندگان :
VARMAZYAR REZVAN varmazyar@iaukhoy.ac.ir DEPARTMENT OF MATHEMATICS, KHOY BRANCH,, ISLAMIC AZAD UNIVERSITY, KHOY
كليدواژه :
lexicographic product , super vertex , cut , super connectivity
عنوان كنفرانس :
سومين همايش بين المللي تركيبيات، رمزنگاري و محاسبات
چكيده فارسي :
Let G_1 and G_2 be two graphs. The lexicographic product of G_1 and G_2 , G_1 o G_2, has vertex set V (G_1 o G_2) = V (G1) * V (G2) and edge set E(G_1 o G_2) = {(a, b)(c, d)\ac e E(G_1) or a = c and bd e E(G_2)}. In this talk we give some properties of G_1 o G_2.
